Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,370; 2,024,928) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,370 = 2 × 5 × 193 × 3,109
6,000,370 is not a prime number but a composite one.
2,024,928 = 25 × 32 × 79 × 89
2,024,928 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:
6,000,370 ÷ 2,024,928 = 2 + 1,950,514
Step 2. Divide the smaller number by the above operation's remainder:
2,024,928 ÷ 1,950,514 = 1 + 74,414
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,514 ÷ 74,414 = 26 + 15,750
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,414 ÷ 15,750 = 4 + 11,414
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
15,750 ÷ 11,414 = 1 + 4,336
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
11,414 ÷ 4,336 = 2 + 2,742
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,336 ÷ 2,742 = 1 + 1,594
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,742 ÷ 1,594 = 1 + 1,148
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,594 ÷ 1,148 = 1 + 446
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,148 ÷ 446 = 2 + 256
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
446 ÷ 256 = 1 + 190
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
256 ÷ 190 = 1 + 66
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
190 ÷ 66 = 2 + 58
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
66 ÷ 58 = 1 + 8
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
58 ÷ 8 = 7 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
8 ÷ 2 = 4 + 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 (6,000,370; 2,024,928) = 2
The two numbers have common prime factors