GCD of 130, 648, 938, 491 Calculator

Given Input numbers are 130, 648, 938, 491

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 648 :

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

1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 81, 108, 162, 216, 324, 648

Divisors of 938 :

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

1, 2, 7, 14, 67, 134, 469, 938

Divisors of 491 :

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

1, 491

GCD of numbers is the greatest common divisor

So, the GCD (130, 648, 938, 491) = 1.

Given numbers are 130, 648, 938, 491

The list of prime factors of all numbers are

Prime factors of 130 are 2 x 5 x 13

Prime factors of 648 are 2 x 2 x 2 x 3 x 3 x 3 x 3

Prime factors of 938 are 2 x 7 x 67

Prime factors of 491 are 491

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

Given numbers are 130, 648, 938, 491

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

Apply this formula for all numbers.

Step1:

LCM(130, 648) = 42120

GCD(130, 648) = ( 130 x 648 ) / 42120

= 130 / 648

= 130

Step2:

LCM(2, 938) = 938

GCD(2, 938) = ( 2 x 938 ) / 938

= 2 / 938

= 2

Step3:

LCM(2, 491) = 982

GCD(2, 491) = ( 2 x 491 ) / 982

= 2 / 491

= 2

So, Greatest Common Divisor of 130, 648, 938, 491 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 919, 720, 923, 819
• GCD of 688, 791, 553, 872
• GCD of 614, 448, 470, 152
• GCD of 632, 556, 103, 251
• GCD of 714, 254, 503, 656

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

1. What is the GCD of 130, 648, 938, 491?

GCD of given numbers 130, 648, 938, 491 is 1

2. How to calculate the greatest common divisor of 130, 648, 938, 491?

We can find the highest common divisor of 130, 648, 938, 491 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, 648, 938, 491 i.e 1.

3. How can I use the GCD of 130, 648, 938, 491Calculator?

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