GCD of 642, 398, 802 Calculator

Given Input numbers are 642, 398, 802

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

Divisors of 642 :

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

1, 2, 3, 6, 107, 214, 321, 642

Divisors of 398 :

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

1, 2, 199, 398

Divisors of 802 :

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

1, 2, 401, 802

GCD of numbers is the greatest common divisor

So, the GCD (642, 398, 802) = 2.

Given numbers are 642, 398, 802

The list of prime factors of all numbers are

Prime factors of 642 are 2 x 3 x 107

Prime factors of 398 are 2 x 199

Prime factors of 802 are 2 x 401

The highest common occurrence is 2¹

Therefore, GCD of 642, 398, 802 is 2.

Given numbers are 642, 398, 802

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

Apply this formula for all numbers.

Step1:

LCM(642, 398) = 127758

GCD(642, 398) = ( 642 x 398 ) / 127758

= 642 / 398

= 642

Step2:

LCM(2, 802) = 802

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

= 2 / 802

= 2

So, Greatest Common Divisor of 642, 398, 802 is 2

Here are some samples of GCD of Numbers calculations.

• GCD of 753, 682, 908
• GCD of 309, 814, 130
• GCD of 332, 927, 342
• GCD of 680, 423, 784
• GCD of 677, 561, 912

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

1. What is the GCD of 642, 398, 802?

GCD of given numbers 642, 398, 802 is 2

2. How to calculate the greatest common divisor of 642, 398, 802?

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

3. How can I use the GCD of 642, 398, 802Calculator?

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