GCD of 873, 971, 473 Calculator

Given Input numbers are 873, 971, 473

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

Divisors of 873

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

1, 3, 9, 97, 291, 873

Divisors of 971

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

1, 971

Divisors of 473

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

1, 11, 43, 473

Greatest Common Divisior

We found the divisors of 873, 971, 473 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 873, 971, 473 is 1.

Therefore, GCD of numbers 873, 971, 473 is 1

Given Input Data is 873, 971, 473

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

Prime Factorization of 873 is 3 x 3 x 97

Prime Factorization of 971 is 971

Prime Factorization of 473 is 11 x 43

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(873, 971) = 847683

GCD(873, 971) = ( 873 x 971 ) / 847683

GCD(873, 971) = 847683 / 847683

GCD(873, 971) = 1

Step2:

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

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

LCM(1, 473) = 473

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

GCD(1, 473) = 473 / 473

GCD(1, 473) = 1

GCD of 873, 971, 473 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 952, 316, 173
• GCD of 450, 466, 278
• GCD of 450, 659, 969
• GCD of 590, 912, 783
• GCD of 960, 883, 869

1. What is the GCD of 873, 971, 473?

GCD of 873, 971, 473 is 1

2. Where do I get the detailed procedure to find GCD of 873, 971, 473?

You can find a detailed procedure to find GCD of 873, 971, 473 on our page.

3. How to find GCD of 873, 971, 473 on a calculator?

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