Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,828; 2,024,990) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,828 = 22 × 59 × 25,423
5,999,828 is not a prime number but a composite one.
2,024,990 = 2 × 5 × 11 × 41 × 449
2,024,990 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,828 ÷ 2,024,990 = 2 + 1,949,848
Step 2. Divide the smaller number by the above operation's remainder:
2,024,990 ÷ 1,949,848 = 1 + 75,142
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,848 ÷ 75,142 = 25 + 71,298
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,142 ÷ 71,298 = 1 + 3,844
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
71,298 ÷ 3,844 = 18 + 2,106
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,844 ÷ 2,106 = 1 + 1,738
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,106 ÷ 1,738 = 1 + 368
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,738 ÷ 368 = 4 + 266
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
368 ÷ 266 = 1 + 102
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
266 ÷ 102 = 2 + 62
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
102 ÷ 62 = 1 + 40
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
62 ÷ 40 = 1 + 22
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
40 ÷ 22 = 1 + 18
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
22 ÷ 18 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
18 ÷ 4 = 4 + 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,828; 2,024,990) = 2
The two numbers have common prime factors