Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,622; 2,024,918) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,622 = 2 × 3 × 113 × 8,849
5,999,622 is not a prime number but a composite one.
2,024,918 = 2 × 7 × 53 × 2,729
2,024,918 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,622 ÷ 2,024,918 = 2 + 1,949,786
Step 2. Divide the smaller number by the above operation's remainder:
2,024,918 ÷ 1,949,786 = 1 + 75,132
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,786 ÷ 75,132 = 25 + 71,486
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,132 ÷ 71,486 = 1 + 3,646
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
71,486 ÷ 3,646 = 19 + 2,212
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,646 ÷ 2,212 = 1 + 1,434
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,212 ÷ 1,434 = 1 + 778
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,434 ÷ 778 = 1 + 656
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
778 ÷ 656 = 1 + 122
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
656 ÷ 122 = 5 + 46
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
122 ÷ 46 = 2 + 30
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
46 ÷ 30 = 1 + 16
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
30 ÷ 16 = 1 + 14
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
16 ÷ 14 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
14 ÷ 2 = 7 + 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,622; 2,024,918) = 2
The two numbers have common prime factors