Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,654; 2,024,941) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,654 = 2 × 3 × 11 × 23 × 59 × 67
6,000,654 is not a prime number but a composite one.
2,024,941 = 67 × 30,223
2,024,941 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,654 ÷ 2,024,941 = 2 + 1,950,772
Step 2. Divide the smaller number by the above operation's remainder:
2,024,941 ÷ 1,950,772 = 1 + 74,169
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,772 ÷ 74,169 = 26 + 22,378
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,169 ÷ 22,378 = 3 + 7,035
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
22,378 ÷ 7,035 = 3 + 1,273
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,035 ÷ 1,273 = 5 + 670
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,273 ÷ 670 = 1 + 603
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
670 ÷ 603 = 1 + 67
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
603 ÷ 67 = 9 + 0
At this step, the remainder is zero, so we stop:
67 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,654; 2,024,941) = 67
The two numbers have common prime factors