GCD of 861, 553, 964 Calculator

Given Input numbers are 861, 553, 964

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 553

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

1, 7, 79, 553

Divisors of 964

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

1, 2, 4, 241, 482, 964

Greatest Common Divisior

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

Therefore, GCD of numbers 861, 553, 964 is 1

Given Input Data is 861, 553, 964

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 553 is 7 x 79

Prime Factorization of 964 is 2 x 2 x 241

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, 553) = 68019

GCD(861, 553) = ( 861 x 553 ) / 68019

GCD(861, 553) = 476133 / 68019

GCD(861, 553) = 7

Step2:

Here we consider the GCD from the above i.e. 7 as first number and the next as 964

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

LCM(7, 964) = 6748

GCD(7, 964) = ( 7 x 964 ) / 6748

GCD(7, 964) = 6748 / 6748

GCD(7, 964) = 1

GCD of 861, 553, 964 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 794, 794, 756
• GCD of 760, 549, 996
• GCD of 411, 993, 413
• GCD of 370, 457, 215
• GCD of 454, 677, 176

1. What is the GCD of 861, 553, 964?

GCD of 861, 553, 964 is 1

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

You can find a detailed procedure to find GCD of 861, 553, 964 on our page.

3. How to find GCD of 861, 553, 964 on a calculator?

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