Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,736; 2,024,938) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,736 = 23 × 3 × 249,989
5,999,736 is not a prime number but a composite one.
2,024,938 = 2 × 17 × 59,557
2,024,938 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,736 ÷ 2,024,938 = 2 + 1,949,860
Step 2. Divide the smaller number by the above operation's remainder:
2,024,938 ÷ 1,949,860 = 1 + 75,078
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,860 ÷ 75,078 = 25 + 72,910
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,078 ÷ 72,910 = 1 + 2,168
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
72,910 ÷ 2,168 = 33 + 1,366
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
2,168 ÷ 1,366 = 1 + 802
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,366 ÷ 802 = 1 + 564
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
802 ÷ 564 = 1 + 238
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
564 ÷ 238 = 2 + 88
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
238 ÷ 88 = 2 + 62
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
88 ÷ 62 = 1 + 26
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
62 ÷ 26 = 2 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
26 ÷ 10 = 2 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 6 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 4 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
4 ÷ 2 = 2 + 0
At this step, the remainder is zero, so we stop:
2 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,736; 2,024,938) = 2
The two numbers have common prime factors