GCD of 409, 985, 129 Calculator

Given Input numbers are 409, 985, 129

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

Divisors of 409

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

1, 409

Divisors of 985

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

1, 5, 197, 985

Divisors of 129

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

1, 3, 43, 129

Greatest Common Divisior

We found the divisors of 409, 985, 129 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 409, 985, 129 is 1.

Therefore, GCD of numbers 409, 985, 129 is 1

Given Input Data is 409, 985, 129

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

Prime Factorization of 409 is 409

Prime Factorization of 985 is 5 x 197

Prime Factorization of 129 is 3 x 43

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(409, 985) = 402865

GCD(409, 985) = ( 409 x 985 ) / 402865

GCD(409, 985) = 402865 / 402865

GCD(409, 985) = 1

Step2:

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

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

LCM(1, 129) = 129

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

GCD(1, 129) = 129 / 129

GCD(1, 129) = 1

GCD of 409, 985, 129 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 872, 601, 523
• GCD of 319, 528, 241
• GCD of 406, 548, 215
• GCD of 571, 886, 679
• GCD of 546, 284, 972

1. What is the GCD of 409, 985, 129?

GCD of 409, 985, 129 is 1

2. Where do I get the detailed procedure to find GCD of 409, 985, 129?

You can find a detailed procedure to find GCD of 409, 985, 129 on our page.

3. How to find GCD of 409, 985, 129 on a calculator?

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