Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,446; 2,024,988) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,446 = 2 × 3,000,223
6,000,446 is not a prime number but a composite one.
2,024,988 = 22 × 3 × 7 × 24,107
2,024,988 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,446 ÷ 2,024,988 = 2 + 1,950,470
Step 2. Divide the smaller number by the above operation's remainder:
2,024,988 ÷ 1,950,470 = 1 + 74,518
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,470 ÷ 74,518 = 26 + 13,002
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,518 ÷ 13,002 = 5 + 9,508
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
13,002 ÷ 9,508 = 1 + 3,494
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,508 ÷ 3,494 = 2 + 2,520
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,494 ÷ 2,520 = 1 + 974
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,520 ÷ 974 = 2 + 572
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
974 ÷ 572 = 1 + 402
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
572 ÷ 402 = 1 + 170
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
402 ÷ 170 = 2 + 62
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
170 ÷ 62 = 2 + 46
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
62 ÷ 46 = 1 + 16
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
46 ÷ 16 = 2 + 14
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
16 ÷ 14 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
14 ÷ 2 = 7 + 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,446; 2,024,988) = 2
The two numbers have common prime factors