Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,204; 2,024,950) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,204 = 22 × 3 × 7 × 61 × 1,171
6,000,204 is not a prime number but a composite one.
2,024,950 = 2 × 52 × 40,499
2,024,950 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,204 ÷ 2,024,950 = 2 + 1,950,304
Step 2. Divide the smaller number by the above operation's remainder:
2,024,950 ÷ 1,950,304 = 1 + 74,646
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,304 ÷ 74,646 = 26 + 9,508
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,646 ÷ 9,508 = 7 + 8,090
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,508 ÷ 8,090 = 1 + 1,418
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,090 ÷ 1,418 = 5 + 1,000
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,418 ÷ 1,000 = 1 + 418
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,000 ÷ 418 = 2 + 164
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
418 ÷ 164 = 2 + 90
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
164 ÷ 90 = 1 + 74
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
90 ÷ 74 = 1 + 16
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
74 ÷ 16 = 4 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
16 ÷ 10 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 6 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 4 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
4 ÷ 2 = 2 + 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,204; 2,024,950) = 2
The two numbers have common prime factors