GCD of 109, 485, 51 Calculator

Given Input numbers are 109, 485, 51

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

Divisors of 109

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

1, 109

Divisors of 485

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

1, 5, 97, 485

Divisors of 51

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

1, 3, 17, 51

Greatest Common Divisior

We found the divisors of 109, 485, 51 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 109, 485, 51 is 1.

Therefore, GCD of numbers 109, 485, 51 is 1

Given Input Data is 109, 485, 51

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

Prime Factorization of 109 is 109

Prime Factorization of 485 is 5 x 97

Prime Factorization of 51 is 3 x 17

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(109, 485) = 52865

GCD(109, 485) = ( 109 x 485 ) / 52865

GCD(109, 485) = 52865 / 52865

GCD(109, 485) = 1

Step2:

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

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

LCM(1, 51) = 51

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

GCD(1, 51) = 51 / 51

GCD(1, 51) = 1

GCD of 109, 485, 51 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 979, 896, 86
• GCD of 174, 511, 17
• GCD of 976, 473, 25
• GCD of 977, 420, 86
• GCD of 750, 243, 84

1. What is the GCD of 109, 485, 51?

GCD of 109, 485, 51 is 1

2. Where do I get the detailed procedure to find GCD of 109, 485, 51?

You can find a detailed procedure to find GCD of 109, 485, 51 on our page.

3. How to find GCD of 109, 485, 51 on a calculator?

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