Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,688; 2,024,972) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,688 = 23 × 32 × 23 × 3,623
5,999,688 is not a prime number but a composite one.
2,024,972 = 22 × 17 × 97 × 307
2,024,972 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,688 ÷ 2,024,972 = 2 + 1,949,744
Step 2. Divide the smaller number by the above operation's remainder:
2,024,972 ÷ 1,949,744 = 1 + 75,228
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,744 ÷ 75,228 = 25 + 69,044
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,228 ÷ 69,044 = 1 + 6,184
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
69,044 ÷ 6,184 = 11 + 1,020
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,184 ÷ 1,020 = 6 + 64
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,020 ÷ 64 = 15 + 60
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
64 ÷ 60 = 1 + 4
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
60 ÷ 4 = 15 + 0
At this step, the remainder is zero, so we stop:
4 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,688; 2,024,972) = 4 = 22
The two numbers have common prime factors