GCD of 979, 647, 171 Calculator

Given Input numbers are 979, 647, 171

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

Divisors of 979

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

1, 11, 89, 979

Divisors of 647

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

1, 647

Divisors of 171

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

1, 3, 9, 19, 57, 171

Greatest Common Divisior

We found the divisors of 979, 647, 171 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 979, 647, 171 is 1.

Therefore, GCD of numbers 979, 647, 171 is 1

Given Input Data is 979, 647, 171

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

Prime Factorization of 979 is 11 x 89

Prime Factorization of 647 is 647

Prime Factorization of 171 is 3 x 3 x 19

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(979, 647) = 633413

GCD(979, 647) = ( 979 x 647 ) / 633413

GCD(979, 647) = 633413 / 633413

GCD(979, 647) = 1

Step2:

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

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

LCM(1, 171) = 171

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

GCD(1, 171) = 171 / 171

GCD(1, 171) = 1

GCD of 979, 647, 171 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 693, 890, 344
• GCD of 975, 995, 251
• GCD of 561, 248, 957
• GCD of 535, 282, 311
• GCD of 138, 417, 692

1. What is the GCD of 979, 647, 171?

GCD of 979, 647, 171 is 1

2. Where do I get the detailed procedure to find GCD of 979, 647, 171?

You can find a detailed procedure to find GCD of 979, 647, 171 on our page.

3. How to find GCD of 979, 647, 171 on a calculator?

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