Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,099; 2,024,946) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,099 = 3 × 76 × 17
6,000,099 is not a prime number but a composite one.
2,024,946 = 2 × 33 × 7 × 11 × 487
2,024,946 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:
6,000,099 ÷ 2,024,946 = 2 + 1,950,207
Step 2. Divide the smaller number by the above operation's remainder:
2,024,946 ÷ 1,950,207 = 1 + 74,739
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,207 ÷ 74,739 = 26 + 6,993
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,739 ÷ 6,993 = 10 + 4,809
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
6,993 ÷ 4,809 = 1 + 2,184
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,809 ÷ 2,184 = 2 + 441
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,184 ÷ 441 = 4 + 420
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
441 ÷ 420 = 1 + 21
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
420 ÷ 21 = 20 + 0
At this step, the remainder is zero, so we stop:
21 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 (6,000,099; 2,024,946) = 21 = 3 × 7
The two numbers have common prime factors