Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,566; 2,024,904) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,566 = 2 × 2,999,783
5,999,566 is not a prime number but a composite one.
2,024,904 = 23 × 3 × 7 × 17 × 709
2,024,904 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,566 ÷ 2,024,904 = 2 + 1,949,758
Step 2. Divide the smaller number by the above operation's remainder:
2,024,904 ÷ 1,949,758 = 1 + 75,146
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,758 ÷ 75,146 = 25 + 71,108
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,146 ÷ 71,108 = 1 + 4,038
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
71,108 ÷ 4,038 = 17 + 2,462
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,038 ÷ 2,462 = 1 + 1,576
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,462 ÷ 1,576 = 1 + 886
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,576 ÷ 886 = 1 + 690
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
886 ÷ 690 = 1 + 196
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
690 ÷ 196 = 3 + 102
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
196 ÷ 102 = 1 + 94
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
102 ÷ 94 = 1 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
94 ÷ 8 = 11 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 6 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 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,566; 2,024,904) = 2
The two numbers have common prime factors