Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,725; 2,024,960) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,725 = 52 × 17 × 19 × 743
5,999,725 is not a prime number but a composite one.
2,024,960 = 29 × 5 × 7 × 113
2,024,960 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,725 ÷ 2,024,960 = 2 + 1,949,805
Step 2. Divide the smaller number by the above operation's remainder:
2,024,960 ÷ 1,949,805 = 1 + 75,155
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,805 ÷ 75,155 = 25 + 70,930
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,155 ÷ 70,930 = 1 + 4,225
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
70,930 ÷ 4,225 = 16 + 3,330
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,225 ÷ 3,330 = 1 + 895
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,330 ÷ 895 = 3 + 645
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
895 ÷ 645 = 1 + 250
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
645 ÷ 250 = 2 + 145
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
250 ÷ 145 = 1 + 105
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
145 ÷ 105 = 1 + 40
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
105 ÷ 40 = 2 + 25
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
40 ÷ 25 = 1 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
25 ÷ 15 = 1 + 10
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
15 ÷ 10 = 1 + 5
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
10 ÷ 5 = 2 + 0
At this step, the remainder is zero, so we stop:
5 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,725; 2,024,960) = 5
The two numbers have common prime factors