Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,898; 2,024,970) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,898 = 2 × 3 × 999,983
5,999,898 is not a prime number but a composite one.
2,024,970 = 2 × 3 × 5 × 67,499
2,024,970 is not a prime number but a composite one.
- Prime number: a natural number that is only divisible by 1 and itself. A prime number has exactly two factors: 1 and itself.
- Composite number: a natural number that has at least one other factor than 1 and itself.
Calculate the greatest (highest) common factor (divisor):
Multiply all the common prime factors, taken by their smallest exponents (the smallest powers).
Step 1. Divide the larger number by the smaller one:
5,999,898 ÷ 2,024,970 = 2 + 1,949,958
Step 2. Divide the smaller number by the above operation's remainder:
2,024,970 ÷ 1,949,958 = 1 + 75,012
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,958 ÷ 75,012 = 25 + 74,658
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,012 ÷ 74,658 = 1 + 354
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
74,658 ÷ 354 = 210 + 318
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
354 ÷ 318 = 1 + 36
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
318 ÷ 36 = 8 + 30
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
36 ÷ 30 = 1 + 6
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
30 ÷ 6 = 5 + 0
At this step, the remainder is zero, so we stop:
6 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
The greatest (highest) common factor (divisor):
gcf, hcf, gcd (5,999,898; 2,024,970) = 6 = 2 × 3
The two numbers have common prime factors