GCD of 989, 861, 479 Calculator

Given Input numbers are 989, 861, 479

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

Divisors of 989

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

1, 23, 43, 989

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 479

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

1, 479

Greatest Common Divisior

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

Therefore, GCD of numbers 989, 861, 479 is 1

Given Input Data is 989, 861, 479

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

Prime Factorization of 989 is 23 x 43

Prime Factorization of 861 is 3 x 7 x 41

Prime Factorization of 479 is 479

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(989, 861) = 851529

GCD(989, 861) = ( 989 x 861 ) / 851529

GCD(989, 861) = 851529 / 851529

GCD(989, 861) = 1

Step2:

Here we consider the GCD from the above i.e. 1 as first number and the next as 479

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

LCM(1, 479) = 479

GCD(1, 479) = ( 1 x 479 ) / 479

GCD(1, 479) = 479 / 479

GCD(1, 479) = 1

GCD of 989, 861, 479 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 975, 790, 877
• GCD of 584, 696, 149
• GCD of 687, 575, 533
• GCD of 611, 805, 941
• GCD of 441, 727, 647

1. What is the GCD of 989, 861, 479?

GCD of 989, 861, 479 is 1

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

You can find a detailed procedure to find GCD of 989, 861, 479 on our page.

3. How to find GCD of 989, 861, 479 on a calculator?

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