Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,444; 2,024,934) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,444 = 22 × 11 × 136,351
5,999,444 is not a prime number but a composite one.
2,024,934 = 2 × 3 × 337,489
2,024,934 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,444 ÷ 2,024,934 = 2 + 1,949,576
Step 2. Divide the smaller number by the above operation's remainder:
2,024,934 ÷ 1,949,576 = 1 + 75,358
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,576 ÷ 75,358 = 25 + 65,626
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,358 ÷ 65,626 = 1 + 9,732
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
65,626 ÷ 9,732 = 6 + 7,234
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,732 ÷ 7,234 = 1 + 2,498
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,234 ÷ 2,498 = 2 + 2,238
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,498 ÷ 2,238 = 1 + 260
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,238 ÷ 260 = 8 + 158
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
260 ÷ 158 = 1 + 102
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
158 ÷ 102 = 1 + 56
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
102 ÷ 56 = 1 + 46
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
56 ÷ 46 = 1 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
46 ÷ 10 = 4 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 6 = 1 + 4
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 4 = 1 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
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,444; 2,024,934) = 2
The two numbers have common prime factors