Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (5,999,892; 2,024,966) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
5,999,892 = 22 × 3 × 79 × 6,329
5,999,892 is not a prime number but a composite one.
2,024,966 = 2 × 23 × 44,021
2,024,966 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,892 ÷ 2,024,966 = 2 + 1,949,960
Step 2. Divide the smaller number by the above operation's remainder:
2,024,966 ÷ 1,949,960 = 1 + 75,006
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,949,960 ÷ 75,006 = 25 + 74,810
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
75,006 ÷ 74,810 = 1 + 196
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
74,810 ÷ 196 = 381 + 134
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
196 ÷ 134 = 1 + 62
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
134 ÷ 62 = 2 + 10
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
62 ÷ 10 = 6 + 2
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
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,892; 2,024,966) = 2
The two numbers have common prime factors