GCD of 964, 646, 322, 130 Calculator

Given Input numbers are 964, 646, 322, 130

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

Divisors of 964 :

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

1, 2, 4, 241, 482, 964

Divisors of 646 :

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

1, 2, 17, 19, 34, 38, 323, 646

Divisors of 322 :

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

1, 2, 7, 14, 23, 46, 161, 322

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 (964, 646, 322, 130) = 2.

Given numbers are 964, 646, 322, 130

The list of prime factors of all numbers are

Prime factors of 964 are 2 x 2 x 241

Prime factors of 646 are 2 x 17 x 19

Prime factors of 322 are 2 x 7 x 23

Prime factors of 130 are 2 x 5 x 13

The highest common occurrence is 2¹

Therefore, GCD of 964, 646, 322, 130 is 2.

Given numbers are 964, 646, 322, 130

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

Apply this formula for all numbers.

Step1:

LCM(964, 646) = 311372

GCD(964, 646) = ( 964 x 646 ) / 311372

= 964 / 646

= 964

Step2:

LCM(2, 322) = 322

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

= 2 / 322

= 2

Step3:

LCM(2, 130) = 130

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

= 2 / 130

= 2

So, Greatest Common Divisor of 964, 646, 322, 130 is 2

Here are some samples of GCD of Numbers calculations.

• GCD of 126, 589, 183, 491
• GCD of 238, 647, 381, 192
• GCD of 857, 647, 136, 474
• GCD of 273, 327, 579, 986
• GCD of 389, 133, 821, 100

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

1. What is the GCD of 964, 646, 322, 130?

GCD of given numbers 964, 646, 322, 130 is 2

2. How to calculate the greatest common divisor of 964, 646, 322, 130?

We can find the highest common divisor of 964, 646, 322, 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 964, 646, 322, 130 i.e 2.

3. How can I use the GCD of 964, 646, 322, 130Calculator?

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