Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,518; 2,024,964) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,518 = 2 × 227 × 13,217
6,000,518 is not a prime number but a composite one.
2,024,964 = 22 × 32 × 56,249
2,024,964 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,518 ÷ 2,024,964 = 2 + 1,950,590
Step 2. Divide the smaller number by the above operation's remainder:
2,024,964 ÷ 1,950,590 = 1 + 74,374
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,590 ÷ 74,374 = 26 + 16,866
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,374 ÷ 16,866 = 4 + 6,910
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
16,866 ÷ 6,910 = 2 + 3,046
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,910 ÷ 3,046 = 2 + 818
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,046 ÷ 818 = 3 + 592
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
818 ÷ 592 = 1 + 226
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
592 ÷ 226 = 2 + 140
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
226 ÷ 140 = 1 + 86
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
140 ÷ 86 = 1 + 54
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
86 ÷ 54 = 1 + 32
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
54 ÷ 32 = 1 + 22
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
32 ÷ 22 = 1 + 10
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
22 ÷ 10 = 2 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
10 ÷ 2 = 5 + 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,518; 2,024,964) = 2
The two numbers have common prime factors