GCD of 398, 730, 842 Calculator

Given Input numbers are 398, 730, 842

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

Divisors of 398 :

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

1, 2, 199, 398

Divisors of 730 :

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

1, 2, 5, 10, 73, 146, 365, 730

Divisors of 842 :

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

1, 2, 421, 842

GCD of numbers is the greatest common divisor

So, the GCD (398, 730, 842) = 2.

Given numbers are 398, 730, 842

The list of prime factors of all numbers are

Prime factors of 398 are 2 x 199

Prime factors of 730 are 2 x 5 x 73

Prime factors of 842 are 2 x 421

The highest common occurrence is 2¹

Therefore, GCD of 398, 730, 842 is 2.

Given numbers are 398, 730, 842

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

Apply this formula for all numbers.

Step1:

LCM(398, 730) = 145270

GCD(398, 730) = ( 398 x 730 ) / 145270

= 398 / 730

= 398

Step2:

LCM(2, 842) = 842

GCD(2, 842) = ( 2 x 842 ) / 842

= 2 / 842

= 2

So, Greatest Common Divisor of 398, 730, 842 is 2

Here are some samples of GCD of Numbers calculations.

• GCD of 937, 140, 305
• GCD of 151, 713, 948
• GCD of 117, 685, 826
• GCD of 913, 670, 846
• GCD of 684, 893, 673

Given numbers are 398, 730, 842
The greatest common divisor of numbers 398, 730, 842 can be found in various methods such as the LCM formula, factoring, and prime factorization. The GCD of numbers 398, 730, 842 is 2.

1. What is the GCD of 398, 730, 842?

GCD of given numbers 398, 730, 842 is 2

2. How to calculate the greatest common divisor of 398, 730, 842?

We can find the highest common divisor of 398, 730, 842 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 398, 730, 842 i.e 2.

3. How can I use the GCD of 398, 730, 842Calculator?

Out the numbers 398, 730, 842 into the GCD calculator and hit the calculate button to get the greatest common divisor as result.