GCD of 489, 131, 429 Calculator

Given Input numbers are 489, 131, 429

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

Divisors of 489

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

1, 3, 163, 489

Divisors of 131

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

1, 131

Divisors of 429

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

1, 3, 11, 13, 33, 39, 143, 429

Greatest Common Divisior

We found the divisors of 489, 131, 429 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 489, 131, 429 is 1.

Therefore, GCD of numbers 489, 131, 429 is 1

Given Input Data is 489, 131, 429

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

Prime Factorization of 489 is 3 x 163

Prime Factorization of 131 is 131

Prime Factorization of 429 is 3 x 11 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(489, 131) = 64059

GCD(489, 131) = ( 489 x 131 ) / 64059

GCD(489, 131) = 64059 / 64059

GCD(489, 131) = 1

Step2:

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

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

LCM(1, 429) = 429

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

GCD(1, 429) = 429 / 429

GCD(1, 429) = 1

GCD of 489, 131, 429 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 321, 544, 599
• GCD of 673, 678, 242
• GCD of 545, 399, 364
• GCD of 939, 360, 184
• GCD of 148, 721, 209

1. What is the GCD of 489, 131, 429?

GCD of 489, 131, 429 is 1

2. Where do I get the detailed procedure to find GCD of 489, 131, 429?

You can find a detailed procedure to find GCD of 489, 131, 429 on our page.

3. How to find GCD of 489, 131, 429 on a calculator?

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