GCD of 501, 817, 159 Calculator

Given Input numbers are 501, 817, 159

To find the GCD of numbers using factoring list out all the divisors of each number

Divisors of 501

List of positive integer divisors of 501 that divides 501 without a remainder.

1, 3, 167, 501

Divisors of 817

List of positive integer divisors of 817 that divides 817 without a remainder.

1, 19, 43, 817

Divisors of 159

List of positive integer divisors of 159 that divides 159 without a remainder.

1, 3, 53, 159

Greatest Common Divisior

We found the divisors of 501, 817, 159 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 501, 817, 159 is 1.

Therefore, GCD of numbers 501, 817, 159 is 1

Given Input Data is 501, 817, 159

Make a list of Prime Factors of all the given numbers initially

Prime Factorization of 501 is 3 x 167

Prime Factorization of 817 is 19 x 43

Prime Factorization of 159 is 3 x 53

The above numbers do not have any common prime factor. So GCD is 1

Step1:

Let's calculate the GCD of first two numbers

The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)

LCM(501, 817) = 409317

GCD(501, 817) = ( 501 x 817 ) / 409317

GCD(501, 817) = 409317 / 409317

GCD(501, 817) = 1

Step2:

Here we consider the GCD from the above i.e. 1 as first number and the next as 159

The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)

LCM(1, 159) = 159

GCD(1, 159) = ( 1 x 159 ) / 159

GCD(1, 159) = 159 / 159

GCD(1, 159) = 1

GCD of 501, 817, 159 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 373, 460, 980
• GCD of 134, 596, 226
• GCD of 582, 213, 505
• GCD of 854, 217, 438
• GCD of 883, 508, 477

1. What is the GCD of 501, 817, 159?

GCD of 501, 817, 159 is 1

2. Where do I get the detailed procedure to find GCD of 501, 817, 159?

You can find a detailed procedure to find GCD of 501, 817, 159 on our page.

3. How to find GCD of 501, 817, 159 on a calculator?

You can find the GCD of 501, 817, 159 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.