Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,342; 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,342 = 2 × 3 × 53 × 18,869
6,000,342 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,342 ÷ 2,024,914 = 2 + 1,950,514
Step 2. Divide the smaller number by the above operation's remainder:
2,024,914 ÷ 1,950,514 = 1 + 74,400
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,514 ÷ 74,400 = 26 + 16,114
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,400 ÷ 16,114 = 4 + 9,944
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
16,114 ÷ 9,944 = 1 + 6,170
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,944 ÷ 6,170 = 1 + 3,774
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,170 ÷ 3,774 = 1 + 2,396
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,774 ÷ 2,396 = 1 + 1,378
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,396 ÷ 1,378 = 1 + 1,018
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,378 ÷ 1,018 = 1 + 360
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,018 ÷ 360 = 2 + 298
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
360 ÷ 298 = 1 + 62
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
298 ÷ 62 = 4 + 50
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
62 ÷ 50 = 1 + 12
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
50 ÷ 12 = 4 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
12 ÷ 2 = 6 + 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,342; 2,024,914) = 2
The two numbers have common prime factors