GCD of 130, 148, 489 Calculator

Given Input numbers are 130, 148, 489

In the factoring method, we have to find the divisors of all numbers

Divisors of 130 :

The positive integer divisors of 130 that completely divides 130 are.

1, 2, 5, 10, 13, 26, 65, 130

Divisors of 148 :

The positive integer divisors of 148 that completely divides 148 are.

1, 2, 4, 37, 74, 148

Divisors of 489 :

The positive integer divisors of 489 that completely divides 489 are.

1, 3, 163, 489

GCD of numbers is the greatest common divisor

So, the GCD (130, 148, 489) = 1.

Given numbers are 130, 148, 489

The list of prime factors of all numbers are

Prime factors of 130 are 2 x 5 x 13

Prime factors of 148 are 2 x 2 x 37

Prime factors of 489 are 3 x 163

The above numbers do not have any common prime factor. So GCD is 1

Given numbers are 130, 148, 489

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

Apply this formula for all numbers.

Step1:

LCM(130, 148) = 9620

GCD(130, 148) = ( 130 x 148 ) / 9620

= 130 / 148

= 130

Step2:

LCM(2, 489) = 978

GCD(2, 489) = ( 2 x 489 ) / 978

= 2 / 489

= 2

So, Greatest Common Divisor of 130, 148, 489 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 348, 650, 452
• GCD of 208, 752, 786
• GCD of 717, 556, 157
• GCD of 482, 446, 400
• GCD of 536, 698, 481

Given numbers are 130, 148, 489
The greatest common divisor of numbers 130, 148, 489 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 130, 148, 489 is 1.

1. What is the GCD of 130, 148, 489?

GCD of given numbers 130, 148, 489 is 1

2. How to calculate the greatest common divisor of 130, 148, 489?

We can find the highest common divisor of 130, 148, 489 easily using the prime factorization method. Just list the prime factors of all numbers and pick the highest common factor which is the GCD of 130, 148, 489 i.e 1.

3. How can I use the GCD of 130, 148, 489Calculator?

Out the numbers 130, 148, 489 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.