GCD of 971, 138, 809 Calculator

Given Input numbers are 971, 138, 809

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

Divisors of 971

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

1, 971

Divisors of 138

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

1, 2, 3, 6, 23, 46, 69, 138

Divisors of 809

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

1, 809

Greatest Common Divisior

We found the divisors of 971, 138, 809 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 971, 138, 809 is 1.

Therefore, GCD of numbers 971, 138, 809 is 1

Given Input Data is 971, 138, 809

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

Prime Factorization of 971 is 971

Prime Factorization of 138 is 2 x 3 x 23

Prime Factorization of 809 is 809

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(971, 138) = 133998

GCD(971, 138) = ( 971 x 138 ) / 133998

GCD(971, 138) = 133998 / 133998

GCD(971, 138) = 1

Step2:

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

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

LCM(1, 809) = 809

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

GCD(1, 809) = 809 / 809

GCD(1, 809) = 1

GCD of 971, 138, 809 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 379, 251, 260
• GCD of 553, 559, 938
• GCD of 963, 314, 223
• GCD of 751, 762, 908
• GCD of 425, 560, 709

1. What is the GCD of 971, 138, 809?

GCD of 971, 138, 809 is 1

2. Where do I get the detailed procedure to find GCD of 971, 138, 809?

You can find a detailed procedure to find GCD of 971, 138, 809 on our page.

3. How to find GCD of 971, 138, 809 on a calculator?

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