Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,568; 2,024,934) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,568 = 24 × 3 × 124,991
5,999,568 is not a prime number but a composite one.
2,024,934 = 2 × 3 × 337,489
2,024,934 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:
5,999,568 ÷ 2,024,934 = 2 + 1,949,700
Step 2. Divide the smaller number by the above operation's remainder:
2,024,934 ÷ 1,949,700 = 1 + 75,234
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,700 ÷ 75,234 = 25 + 68,850
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,234 ÷ 68,850 = 1 + 6,384
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
68,850 ÷ 6,384 = 10 + 5,010
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,384 ÷ 5,010 = 1 + 1,374
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,010 ÷ 1,374 = 3 + 888
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,374 ÷ 888 = 1 + 486
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
888 ÷ 486 = 1 + 402
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
486 ÷ 402 = 1 + 84
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
402 ÷ 84 = 4 + 66
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
84 ÷ 66 = 1 + 18
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
66 ÷ 18 = 3 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
18 ÷ 12 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 6 = 2 + 0
At this step, the remainder is zero, so we stop:
6 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 (5,999,568; 2,024,934) = 6 = 2 × 3
The two numbers have common prime factors