Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,358; 2,024,911) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,358 = 2 × 7 × 13 × 32,969
6,000,358 is not a prime number but a composite one.
2,024,911 = 7 × 289,273
2,024,911 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,358 ÷ 2,024,911 = 2 + 1,950,536
Step 2. Divide the smaller number by the above operation's remainder:
2,024,911 ÷ 1,950,536 = 1 + 74,375
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,536 ÷ 74,375 = 26 + 16,786
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,375 ÷ 16,786 = 4 + 7,231
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
16,786 ÷ 7,231 = 2 + 2,324
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,231 ÷ 2,324 = 3 + 259
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,324 ÷ 259 = 8 + 252
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
259 ÷ 252 = 1 + 7
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
252 ÷ 7 = 36 + 0
At this step, the remainder is zero, so we stop:
7 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,358; 2,024,911) = 7
The two numbers have common prime factors