Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,351; 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,351 = 3 × 7 × 285,731
6,000,351 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,351 ÷ 2,024,913 = 2 + 1,950,525
Step 2. Divide the smaller number by the above operation's remainder:
2,024,913 ÷ 1,950,525 = 1 + 74,388
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,525 ÷ 74,388 = 26 + 16,437
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,388 ÷ 16,437 = 4 + 8,640
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
16,437 ÷ 8,640 = 1 + 7,797
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,640 ÷ 7,797 = 1 + 843
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,797 ÷ 843 = 9 + 210
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
843 ÷ 210 = 4 + 3
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
210 ÷ 3 = 70 + 0
At this step, the remainder is zero, so we stop:
3 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,351; 2,024,913) = 3
The two numbers have common prime factors