Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,435; 2,024,975) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,435 = 5 × 13 × 23 × 4,013
5,999,435 is not a prime number but a composite one.
2,024,975 = 52 × 107 × 757
2,024,975 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,435 ÷ 2,024,975 = 2 + 1,949,485
Step 2. Divide the smaller number by the above operation's remainder:
2,024,975 ÷ 1,949,485 = 1 + 75,490
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,485 ÷ 75,490 = 25 + 62,235
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,490 ÷ 62,235 = 1 + 13,255
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
62,235 ÷ 13,255 = 4 + 9,215
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,255 ÷ 9,215 = 1 + 4,040
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,215 ÷ 4,040 = 2 + 1,135
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,040 ÷ 1,135 = 3 + 635
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,135 ÷ 635 = 1 + 500
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
635 ÷ 500 = 1 + 135
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
500 ÷ 135 = 3 + 95
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
135 ÷ 95 = 1 + 40
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
95 ÷ 40 = 2 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
40 ÷ 15 = 2 + 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,435; 2,024,975) = 5
The two numbers have common prime factors