GCD of 370, 393, 873 Calculator

Given Input numbers are 370, 393, 873

In the factoring method, we have to find the divisors of all numbers

Divisors of 370 :

The positive integer divisors of 370 that completely divides 370 are.

1, 2, 5, 10, 37, 74, 185, 370

Divisors of 393 :

The positive integer divisors of 393 that completely divides 393 are.

1, 3, 131, 393

Divisors of 873 :

The positive integer divisors of 873 that completely divides 873 are.

1, 3, 9, 97, 291, 873

GCD of numbers is the greatest common divisor

So, the GCD (370, 393, 873) = 1.

Given numbers are 370, 393, 873

The list of prime factors of all numbers are

Prime factors of 370 are 2 x 5 x 37

Prime factors of 393 are 3 x 131

Prime factors of 873 are 3 x 3 x 97

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

Given numbers are 370, 393, 873

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

Apply this formula for all numbers.

Step1:

LCM(370, 393) = 145410

GCD(370, 393) = ( 370 x 393 ) / 145410

= 370 / 393

= 370

Step2:

LCM(1, 873) = 873

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

= 1 / 873

= 1

So, Greatest Common Divisor of 370, 393, 873 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 923, 565, 393
• GCD of 809, 574, 133
• GCD of 339, 464, 809
• GCD of 759, 241, 388
• GCD of 465, 410, 904

Given numbers are 370, 393, 873
The greatest common divisor of numbers 370, 393, 873 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 370, 393, 873 is 1.

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

GCD of given numbers 370, 393, 873 is 1

2. How to calculate the greatest common divisor of 370, 393, 873?

We can find the highest common divisor of 370, 393, 873 easily using the prime factorization method. Just list the prime factors of all numbers and pick the highest common factor which is the GCD of 370, 393, 873 i.e 1.

3. How can I use the GCD of 370, 393, 873Calculator?

Out the numbers 370, 393, 873 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.