Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,525; 2,024,958) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,525 = 32 × 52 × 26,669
6,000,525 is not a prime number but a composite one.
2,024,958 = 2 × 3 × 132 × 1,997
2,024,958 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,525 ÷ 2,024,958 = 2 + 1,950,609
Step 2. Divide the smaller number by the above operation's remainder:
2,024,958 ÷ 1,950,609 = 1 + 74,349
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,609 ÷ 74,349 = 26 + 17,535
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,349 ÷ 17,535 = 4 + 4,209
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
17,535 ÷ 4,209 = 4 + 699
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,209 ÷ 699 = 6 + 15
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
699 ÷ 15 = 46 + 9
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
15 ÷ 9 = 1 + 6
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
9 ÷ 6 = 1 + 3
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
6 ÷ 3 = 2 + 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,525; 2,024,958) = 3
The two numbers have common prime factors