Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,470; 2,024,942) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,470 = 2 × 5 × 17 × 35,291
5,999,470 is not a prime number but a composite one.
2,024,942 = 2 × 499 × 2,029
2,024,942 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,470 ÷ 2,024,942 = 2 + 1,949,586
Step 2. Divide the smaller number by the above operation's remainder:
2,024,942 ÷ 1,949,586 = 1 + 75,356
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,586 ÷ 75,356 = 25 + 65,686
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,356 ÷ 65,686 = 1 + 9,670
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
65,686 ÷ 9,670 = 6 + 7,666
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,670 ÷ 7,666 = 1 + 2,004
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,666 ÷ 2,004 = 3 + 1,654
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,004 ÷ 1,654 = 1 + 350
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,654 ÷ 350 = 4 + 254
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
350 ÷ 254 = 1 + 96
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
254 ÷ 96 = 2 + 62
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
96 ÷ 62 = 1 + 34
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
62 ÷ 34 = 1 + 28
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
34 ÷ 28 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
28 ÷ 6 = 4 + 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,470; 2,024,942) = 2
The two numbers have common prime factors