GCD of 489, 825, 11 Calculator

Given Input numbers are 489, 825, 11

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 825

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

1, 3, 5, 11, 15, 25, 33, 55, 75, 165, 275, 825

Divisors of 11

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

1, 11

Greatest Common Divisior

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

Therefore, GCD of numbers 489, 825, 11 is 1

Given Input Data is 489, 825, 11

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

Prime Factorization of 489 is 3 x 163

Prime Factorization of 825 is 3 x 5 x 5 x 11

Prime Factorization of 11 is 11

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, 825) = 134475

GCD(489, 825) = ( 489 x 825 ) / 134475

GCD(489, 825) = 403425 / 134475

GCD(489, 825) = 3

Step2:

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

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

LCM(3, 11) = 33

GCD(3, 11) = ( 3 x 11 ) / 33

GCD(3, 11) = 33 / 33

GCD(3, 11) = 1

GCD of 489, 825, 11 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 679, 587, 34
• GCD of 637, 234, 66
• GCD of 563, 566, 18
• GCD of 511, 663, 63
• GCD of 191, 942, 40

1. What is the GCD of 489, 825, 11?

GCD of 489, 825, 11 is 1

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

You can find a detailed procedure to find GCD of 489, 825, 11 on our page.

3. How to find GCD of 489, 825, 11 on a calculator?

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