GCD of 130, 998, 326 Calculator

Given Input numbers are 130, 998, 326

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

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

1, 2, 499, 998

Divisors of 326 :

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

1, 2, 163, 326

GCD of numbers is the greatest common divisor

So, the GCD (130, 998, 326) = 2.

Given numbers are 130, 998, 326

The list of prime factors of all numbers are

Prime factors of 130 are 2 x 5 x 13

Prime factors of 998 are 2 x 499

Prime factors of 326 are 2 x 163

The highest common occurrence is 2¹

Therefore, GCD of 130, 998, 326 is 2.

Given numbers are 130, 998, 326

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

Apply this formula for all numbers.

Step1:

LCM(130, 998) = 64870

GCD(130, 998) = ( 130 x 998 ) / 64870

= 130 / 998

= 130

Step2:

LCM(2, 326) = 326

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

= 2 / 326

= 2

So, Greatest Common Divisor of 130, 998, 326 is 2

Here are some samples of GCD of Numbers calculations.

• GCD of 805, 965, 468
• GCD of 506, 543, 283
• GCD of 189, 997, 345
• GCD of 871, 702, 154
• GCD of 479, 395, 400

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

1. What is the GCD of 130, 998, 326?

GCD of given numbers 130, 998, 326 is 2

2. How to calculate the greatest common divisor of 130, 998, 326?

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

3. How can I use the GCD of 130, 998, 326Calculator?

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