Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,273; 2,024,970) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,273 = 32 × 666,697
6,000,273 is not a prime number but a composite one.
2,024,970 = 2 × 3 × 5 × 67,499
2,024,970 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,273 ÷ 2,024,970 = 2 + 1,950,333
Step 2. Divide the smaller number by the above operation's remainder:
2,024,970 ÷ 1,950,333 = 1 + 74,637
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,333 ÷ 74,637 = 26 + 9,771
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,637 ÷ 9,771 = 7 + 6,240
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,771 ÷ 6,240 = 1 + 3,531
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,240 ÷ 3,531 = 1 + 2,709
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,531 ÷ 2,709 = 1 + 822
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,709 ÷ 822 = 3 + 243
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
822 ÷ 243 = 3 + 93
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
243 ÷ 93 = 2 + 57
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
93 ÷ 57 = 1 + 36
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
57 ÷ 36 = 1 + 21
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
36 ÷ 21 = 1 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
21 ÷ 15 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
15 ÷ 6 = 2 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,273; 2,024,970) = 3
The two numbers have common prime factors