Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,638; 2,024,958) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,638 = 2 × 2,999,819
5,999,638 is not a prime number but a composite one.
2,024,958 = 2 × 3 × 132 × 1,997
2,024,958 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,638 ÷ 2,024,958 = 2 + 1,949,722
Step 2. Divide the smaller number by the above operation's remainder:
2,024,958 ÷ 1,949,722 = 1 + 75,236
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,722 ÷ 75,236 = 25 + 68,822
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,236 ÷ 68,822 = 1 + 6,414
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
68,822 ÷ 6,414 = 10 + 4,682
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,414 ÷ 4,682 = 1 + 1,732
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,682 ÷ 1,732 = 2 + 1,218
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,732 ÷ 1,218 = 1 + 514
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,218 ÷ 514 = 2 + 190
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
514 ÷ 190 = 2 + 134
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
190 ÷ 134 = 1 + 56
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
134 ÷ 56 = 2 + 22
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
56 ÷ 22 = 2 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
22 ÷ 12 = 1 + 10
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 10 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
10 ÷ 2 = 5 + 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 (5,999,638; 2,024,958) = 2
The two numbers have common prime factors