Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,291; 2,024,913) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,291 = 33 × 11 × 89 × 227
6,000,291 is not a prime number but a composite one.
2,024,913 = 3 × 11 × 43 × 1,427
2,024,913 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,291 ÷ 2,024,913 = 2 + 1,950,465
Step 2. Divide the smaller number by the above operation's remainder:
2,024,913 ÷ 1,950,465 = 1 + 74,448
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,465 ÷ 74,448 = 26 + 14,817
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,448 ÷ 14,817 = 5 + 363
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
14,817 ÷ 363 = 40 + 297
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
363 ÷ 297 = 1 + 66
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
297 ÷ 66 = 4 + 33
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
66 ÷ 33 = 2 + 0
At this step, the remainder is zero, so we stop:
33 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,291; 2,024,913) = 33 = 3 × 11
The two numbers have common prime factors