GCD of 981, 567, 861, 130 Calculator

Given Input numbers are 981, 567, 861, 130

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

Divisors of 981 :

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

1, 3, 9, 109, 327, 981

Divisors of 567 :

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

1, 3, 7, 9, 21, 27, 63, 81, 189, 567

Divisors of 861 :

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

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

Divisors of 130 :

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

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

GCD of numbers is the greatest common divisor

So, the GCD (981, 567, 861, 130) = 1.

Given numbers are 981, 567, 861, 130

The list of prime factors of all numbers are

Prime factors of 981 are 3 x 3 x 109

Prime factors of 567 are 3 x 3 x 3 x 3 x 7

Prime factors of 861 are 3 x 7 x 41

Prime factors of 130 are 2 x 5 x 13

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

Given numbers are 981, 567, 861, 130

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

Apply this formula for all numbers.

Step1:

LCM(981, 567) = 61803

GCD(981, 567) = ( 981 x 567 ) / 61803

= 981 / 567

= 981

Step2:

LCM(9, 861) = 2583

GCD(9, 861) = ( 9 x 861 ) / 2583

= 9 / 861

= 9

Step3:

LCM(3, 130) = 390

GCD(3, 130) = ( 3 x 130 ) / 390

= 3 / 130

= 3

So, Greatest Common Divisor of 981, 567, 861, 130 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 232, 533, 801, 331
• GCD of 888, 336, 860, 702
• GCD of 188, 127, 878, 986
• GCD of 372, 762, 404, 108
• GCD of 294, 954, 424, 858

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

1. What is the GCD of 981, 567, 861, 130?

GCD of given numbers 981, 567, 861, 130 is 1

2. How to calculate the greatest common divisor of 981, 567, 861, 130?

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

3. How can I use the GCD of 981, 567, 861, 130Calculator?

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