GCD of 861, 549, 20 Calculator

Given Input numbers are 861, 549, 20

To find the GCD of numbers using factoring list out all the divisors of each number

Divisors of 861

List of positive integer divisors of 861 that divides 861 without a remainder.

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

Divisors of 549

List of positive integer divisors of 549 that divides 549 without a remainder.

1, 3, 9, 61, 183, 549

Divisors of 20

List of positive integer divisors of 20 that divides 20 without a remainder.

1, 2, 4, 5, 10, 20

Greatest Common Divisior

We found the divisors of 861, 549, 20 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 861, 549, 20 is 1.

Therefore, GCD of numbers 861, 549, 20 is 1

Given Input Data is 861, 549, 20

Make a list of Prime Factors of all the given numbers initially

Prime Factorization of 861 is 3 x 7 x 41

Prime Factorization of 549 is 3 x 3 x 61

Prime Factorization of 20 is 2 x 2 x 5

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

Step1:

Let's calculate the GCD of first two numbers

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

LCM(861, 549) = 157563

GCD(861, 549) = ( 861 x 549 ) / 157563

GCD(861, 549) = 472689 / 157563

GCD(861, 549) = 3

Step2:

Here we consider the GCD from the above i.e. 3 as first number and the next as 20

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

LCM(3, 20) = 60

GCD(3, 20) = ( 3 x 20 ) / 60

GCD(3, 20) = 60 / 60

GCD(3, 20) = 1

GCD of 861, 549, 20 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 478, 650, 94
• GCD of 489, 743, 19
• GCD of 816, 927, 71
• GCD of 676, 705, 21
• GCD of 508, 596, 91

1. What is the GCD of 861, 549, 20?

GCD of 861, 549, 20 is 1

2. Where do I get the detailed procedure to find GCD of 861, 549, 20?

You can find a detailed procedure to find GCD of 861, 549, 20 on our page.

3. How to find GCD of 861, 549, 20 on a calculator?

You can find the GCD of 861, 549, 20 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.