Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,536; 2,024,938) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,536 = 23 × 59 × 12,713
6,000,536 is not a prime number but a composite one.
2,024,938 = 2 × 17 × 59,557
2,024,938 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,536 ÷ 2,024,938 = 2 + 1,950,660
Step 2. Divide the smaller number by the above operation's remainder:
2,024,938 ÷ 1,950,660 = 1 + 74,278
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,660 ÷ 74,278 = 26 + 19,432
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,278 ÷ 19,432 = 3 + 15,982
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
19,432 ÷ 15,982 = 1 + 3,450
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
15,982 ÷ 3,450 = 4 + 2,182
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,450 ÷ 2,182 = 1 + 1,268
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,182 ÷ 1,268 = 1 + 914
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,268 ÷ 914 = 1 + 354
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
914 ÷ 354 = 2 + 206
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
354 ÷ 206 = 1 + 148
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
206 ÷ 148 = 1 + 58
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
148 ÷ 58 = 2 + 32
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
58 ÷ 32 = 1 + 26
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
32 ÷ 26 = 1 + 6
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
26 ÷ 6 = 4 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
6 ÷ 2 = 3 + 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,536; 2,024,938) = 2
The two numbers have common prime factors