Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,210; 2,024,930) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,210 = 2 × 33 × 5 × 71 × 313
6,000,210 is not a prime number but a composite one.
2,024,930 = 2 × 5 × 202,493
2,024,930 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,210 ÷ 2,024,930 = 2 + 1,950,350
Step 2. Divide the smaller number by the above operation's remainder:
2,024,930 ÷ 1,950,350 = 1 + 74,580
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,350 ÷ 74,580 = 26 + 11,270
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,580 ÷ 11,270 = 6 + 6,960
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
11,270 ÷ 6,960 = 1 + 4,310
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,960 ÷ 4,310 = 1 + 2,650
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,310 ÷ 2,650 = 1 + 1,660
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,650 ÷ 1,660 = 1 + 990
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,660 ÷ 990 = 1 + 670
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
990 ÷ 670 = 1 + 320
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
670 ÷ 320 = 2 + 30
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
320 ÷ 30 = 10 + 20
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
30 ÷ 20 = 1 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
20 ÷ 10 = 2 + 0
At this step, the remainder is zero, so we stop:
10 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,210; 2,024,930) = 10 = 2 × 5
The two numbers have common prime factors