GCD of 368, 130, 916, 604 Calculator

Given Input numbers are 368, 130, 916, 604

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

Divisors of 368 :

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

1, 2, 4, 8, 16, 23, 46, 92, 184, 368

Divisors of 130 :

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

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

Divisors of 916 :

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

1, 2, 4, 229, 458, 916

Divisors of 604 :

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

1, 2, 4, 151, 302, 604

GCD of numbers is the greatest common divisor

So, the GCD (368, 130, 916, 604) = 2.

Given numbers are 368, 130, 916, 604

The list of prime factors of all numbers are

Prime factors of 368 are 2 x 2 x 2 x 2 x 23

Prime factors of 130 are 2 x 5 x 13

Prime factors of 916 are 2 x 2 x 229

Prime factors of 604 are 2 x 2 x 151

The highest common occurrence is 2¹

Therefore, GCD of 368, 130, 916, 604 is 2.

Given numbers are 368, 130, 916, 604

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

Apply this formula for all numbers.

Step1:

LCM(368, 130) = 23920

GCD(368, 130) = ( 368 x 130 ) / 23920

= 368 / 130

= 368

Step2:

LCM(2, 916) = 916

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

= 2 / 916

= 2

Step3:

LCM(2, 604) = 604

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

= 2 / 604

= 2

So, Greatest Common Divisor of 368, 130, 916, 604 is 2

Here are some samples of GCD of Numbers calculations.

• GCD of 793, 970, 641, 695
• GCD of 792, 700, 469, 679
• GCD of 926, 289, 721, 126
• GCD of 747, 445, 299, 199
• GCD of 288, 783, 793, 961

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

1. What is the GCD of 368, 130, 916, 604?

GCD of given numbers 368, 130, 916, 604 is 2

2. How to calculate the greatest common divisor of 368, 130, 916, 604?

We can find the highest common divisor of 368, 130, 916, 604 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 368, 130, 916, 604 i.e 2.

3. How can I use the GCD of 368, 130, 916, 604Calculator?

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