Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,888; 2,024,920) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,888 = 24 × 374,993
5,999,888 is not a prime number but a composite one.
2,024,920 = 23 × 5 × 23 × 31 × 71
2,024,920 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,888 ÷ 2,024,920 = 2 + 1,950,048
Step 2. Divide the smaller number by the above operation's remainder:
2,024,920 ÷ 1,950,048 = 1 + 74,872
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,048 ÷ 74,872 = 26 + 3,376
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,872 ÷ 3,376 = 22 + 600
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
3,376 ÷ 600 = 5 + 376
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
600 ÷ 376 = 1 + 224
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
376 ÷ 224 = 1 + 152
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
224 ÷ 152 = 1 + 72
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
152 ÷ 72 = 2 + 8
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
72 ÷ 8 = 9 + 0
At this step, the remainder is zero, so we stop:
8 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,888; 2,024,920) = 8 = 23
The two numbers have common prime factors