GCD of 861, 969, 52 Calculator

Given Input numbers are 861, 969, 52

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

Divisors of 861

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

1, 3, 7, 21, 41, 123, 287, 861

Divisors of 969

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

1, 3, 17, 19, 51, 57, 323, 969

Divisors of 52

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

1, 2, 4, 13, 26, 52

Greatest Common Divisior

We found the divisors of 861, 969, 52 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 861, 969, 52 is 1.

Therefore, GCD of numbers 861, 969, 52 is 1

Given Input Data is 861, 969, 52

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

Prime Factorization of 861 is 3 x 7 x 41

Prime Factorization of 969 is 3 x 17 x 19

Prime Factorization of 52 is 2 x 2 x 13

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(861, 969) = 278103

GCD(861, 969) = ( 861 x 969 ) / 278103

GCD(861, 969) = 834309 / 278103

GCD(861, 969) = 3

Step2:

Here we consider the GCD from the above i.e. 3 as first number and the next as 52

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

LCM(3, 52) = 156

GCD(3, 52) = ( 3 x 52 ) / 156

GCD(3, 52) = 156 / 156

GCD(3, 52) = 1

GCD of 861, 969, 52 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 223, 307, 39
• GCD of 467, 583, 91
• GCD of 733, 828, 82
• GCD of 947, 287, 68
• GCD of 793, 203, 97

1. What is the GCD of 861, 969, 52?

GCD of 861, 969, 52 is 1

2. Where do I get the detailed procedure to find GCD of 861, 969, 52?

You can find a detailed procedure to find GCD of 861, 969, 52 on our page.

3. How to find GCD of 861, 969, 52 on a calculator?

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