GCD of 558, 188, 20 Calculator

Given Input numbers are 558, 188, 20

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

Divisors of 558 :

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

1, 2, 3, 6, 9, 18, 31, 62, 93, 186, 279, 558

Divisors of 188 :

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

1, 2, 4, 47, 94, 188

Divisors of 20 :

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

1, 2, 4, 5, 10, 20

GCD of numbers is the greatest common divisor

So, the GCD (558, 188, 20) = 2.

Given numbers are 558, 188, 20

The list of prime factors of all numbers are

Prime factors of 558 are 2 x 3 x 3 x 31

Prime factors of 188 are 2 x 2 x 47

Prime factors of 20 are 2 x 2 x 5

The highest common occurrence is 2¹

Therefore, GCD of 558, 188, 20 is 2.

Given numbers are 558, 188, 20

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

Apply this formula for all numbers.

Step1:

LCM(558, 188) = 52452

GCD(558, 188) = ( 558 x 188 ) / 52452

= 558 / 188

= 558

Step2:

LCM(2, 20) = 20

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

= 2 / 20

= 2

So, Greatest Common Divisor of 558, 188, 20 is 2

Here are some samples of GCD of Numbers calculations.

• GCD of 510, 978, 57
• GCD of 681, 469, 17
• GCD of 661, 839, 94
• GCD of 382, 982, 88
• GCD of 221, 456, 58

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

1. What is the GCD of 558, 188, 20?

GCD of given numbers 558, 188, 20 is 2

2. How to calculate the greatest common divisor of 558, 188, 20?

We can find the highest common divisor of 558, 188, 20 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 558, 188, 20 i.e 2.

3. How can I use the GCD of 558, 188, 20Calculator?

Out the numbers 558, 188, 20 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.