Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,012; 2,024,967) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,012 = 22 × 32 × 166,667
6,000,012 is not a prime number but a composite one.
2,024,967 = 3 × 7 × 211 × 457
2,024,967 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,012 ÷ 2,024,967 = 2 + 1,950,078
Step 2. Divide the smaller number by the above operation's remainder:
2,024,967 ÷ 1,950,078 = 1 + 74,889
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,078 ÷ 74,889 = 26 + 2,964
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,889 ÷ 2,964 = 25 + 789
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
2,964 ÷ 789 = 3 + 597
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
789 ÷ 597 = 1 + 192
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
597 ÷ 192 = 3 + 21
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
192 ÷ 21 = 9 + 3
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
21 ÷ 3 = 7 + 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,012; 2,024,967) = 3
The two numbers have common prime factors