Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,357; 2,024,916) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,357 = 3 × 11 × 349 × 521
6,000,357 is not a prime number but a composite one.
2,024,916 = 22 × 3 × 168,743
2,024,916 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,357 ÷ 2,024,916 = 2 + 1,950,525
Step 2. Divide the smaller number by the above operation's remainder:
2,024,916 ÷ 1,950,525 = 1 + 74,391
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,525 ÷ 74,391 = 26 + 16,359
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,391 ÷ 16,359 = 4 + 8,955
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
16,359 ÷ 8,955 = 1 + 7,404
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,955 ÷ 7,404 = 1 + 1,551
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,404 ÷ 1,551 = 4 + 1,200
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,551 ÷ 1,200 = 1 + 351
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,200 ÷ 351 = 3 + 147
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
351 ÷ 147 = 2 + 57
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
147 ÷ 57 = 2 + 33
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
57 ÷ 33 = 1 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
33 ÷ 24 = 1 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 9 = 2 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
9 ÷ 6 = 1 + 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,357; 2,024,916) = 3
The two numbers have common prime factors