Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,568; 2,024,944) = ?
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,944 = 24 × 19 × 6,661
2,024,944 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,944 = 2 + 1,949,680
Step 2. Divide the smaller number by the above operation's remainder:
2,024,944 ÷ 1,949,680 = 1 + 75,264
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,680 ÷ 75,264 = 25 + 68,080
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,264 ÷ 68,080 = 1 + 7,184
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
68,080 ÷ 7,184 = 9 + 3,424
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,184 ÷ 3,424 = 2 + 336
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,424 ÷ 336 = 10 + 64
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
336 ÷ 64 = 5 + 16
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
64 ÷ 16 = 4 + 0
At this step, the remainder is zero, so we stop:
16 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,944) = 16 = 24
The two numbers have common prime factors