GCD of 873, 487, 393 Calculator

Given Input numbers are 873, 487, 393

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 487

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

1, 487

Divisors of 393

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

1, 3, 131, 393

Greatest Common Divisior

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

Therefore, GCD of numbers 873, 487, 393 is 1

Given Input Data is 873, 487, 393

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 487 is 487

Prime Factorization of 393 is 3 x 131

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, 487) = 425151

GCD(873, 487) = ( 873 x 487 ) / 425151

GCD(873, 487) = 425151 / 425151

GCD(873, 487) = 1

Step2:

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

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

LCM(1, 393) = 393

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

GCD(1, 393) = 393 / 393

GCD(1, 393) = 1

GCD of 873, 487, 393 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 564, 849, 728
• GCD of 427, 224, 210
• GCD of 516, 952, 762
• GCD of 318, 758, 193
• GCD of 391, 576, 362

1. What is the GCD of 873, 487, 393?

GCD of 873, 487, 393 is 1

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

You can find a detailed procedure to find GCD of 873, 487, 393 on our page.

3. How to find GCD of 873, 487, 393 on a calculator?

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