Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,154; 2,024,964) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,154 = 2 × 3,000,077
6,000,154 is not a prime number but a composite one.
2,024,964 = 22 × 32 × 56,249
2,024,964 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,154 ÷ 2,024,964 = 2 + 1,950,226
Step 2. Divide the smaller number by the above operation's remainder:
2,024,964 ÷ 1,950,226 = 1 + 74,738
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,226 ÷ 74,738 = 26 + 7,038
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,738 ÷ 7,038 = 10 + 4,358
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
7,038 ÷ 4,358 = 1 + 2,680
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,358 ÷ 2,680 = 1 + 1,678
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,680 ÷ 1,678 = 1 + 1,002
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,678 ÷ 1,002 = 1 + 676
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,002 ÷ 676 = 1 + 326
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
676 ÷ 326 = 2 + 24
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
326 ÷ 24 = 13 + 14
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
24 ÷ 14 = 1 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
14 ÷ 10 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 4 = 2 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,154; 2,024,964) = 2
The two numbers have common prime factors