GCD of 130, 861, 491, 782 Calculator

Given Input numbers are 130, 861, 491, 782

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

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

1, 3, 7, 21, 41, 123, 287, 861

Divisors of 491 :

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

1, 491

Divisors of 782 :

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

1, 2, 17, 23, 34, 46, 391, 782

GCD of numbers is the greatest common divisor

So, the GCD (130, 861, 491, 782) = 1.

Given numbers are 130, 861, 491, 782

The list of prime factors of all numbers are

Prime factors of 130 are 2 x 5 x 13

Prime factors of 861 are 3 x 7 x 41

Prime factors of 491 are 491

Prime factors of 782 are 2 x 17 x 23

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

Given numbers are 130, 861, 491, 782

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

Apply this formula for all numbers.

Step1:

LCM(130, 861) = 111930

GCD(130, 861) = ( 130 x 861 ) / 111930

= 130 / 861

= 130

Step2:

LCM(1, 491) = 491

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

= 1 / 491

= 1

Step3:

LCM(1, 782) = 782

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

= 1 / 782

= 1

So, Greatest Common Divisor of 130, 861, 491, 782 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 837, 641, 966, 327
• GCD of 322, 423, 878, 635
• GCD of 249, 939, 879, 996
• GCD of 347, 849, 604, 254
• GCD of 656, 261, 856, 210

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

1. What is the GCD of 130, 861, 491, 782?

GCD of given numbers 130, 861, 491, 782 is 1

2. How to calculate the greatest common divisor of 130, 861, 491, 782?

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

3. How can I use the GCD of 130, 861, 491, 782Calculator?

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