Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,356; 2,024,910) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,356 = 22 × 163 × 9,203
6,000,356 is not a prime number but a composite one.
2,024,910 = 2 × 32 × 5 × 149 × 151
2,024,910 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,356 ÷ 2,024,910 = 2 + 1,950,536
Step 2. Divide the smaller number by the above operation's remainder:
2,024,910 ÷ 1,950,536 = 1 + 74,374
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,536 ÷ 74,374 = 26 + 16,812
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,374 ÷ 16,812 = 4 + 7,126
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
16,812 ÷ 7,126 = 2 + 2,560
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,126 ÷ 2,560 = 2 + 2,006
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,560 ÷ 2,006 = 1 + 554
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,006 ÷ 554 = 3 + 344
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
554 ÷ 344 = 1 + 210
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
344 ÷ 210 = 1 + 134
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
210 ÷ 134 = 1 + 76
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
134 ÷ 76 = 1 + 58
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
76 ÷ 58 = 1 + 18
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
58 ÷ 18 = 3 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
18 ÷ 4 = 4 + 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,356; 2,024,910) = 2
The two numbers have common prime factors