Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,108; 2,024,914) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,108 = 22 × 3 × 500,009
6,000,108 is not a prime number but a composite one.
2,024,914 = 2 × 1,012,457
2,024,914 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,108 ÷ 2,024,914 = 2 + 1,950,280
Step 2. Divide the smaller number by the above operation's remainder:
2,024,914 ÷ 1,950,280 = 1 + 74,634
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,280 ÷ 74,634 = 26 + 9,796
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,634 ÷ 9,796 = 7 + 6,062
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,796 ÷ 6,062 = 1 + 3,734
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,062 ÷ 3,734 = 1 + 2,328
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,734 ÷ 2,328 = 1 + 1,406
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,328 ÷ 1,406 = 1 + 922
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,406 ÷ 922 = 1 + 484
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
922 ÷ 484 = 1 + 438
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
484 ÷ 438 = 1 + 46
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
438 ÷ 46 = 9 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
46 ÷ 24 = 1 + 22
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 22 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
22 ÷ 2 = 11 + 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,108; 2,024,914) = 2
The two numbers have common prime factors