Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,566; 2,024,972) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,566 = 2 × 11 × 13 × 20,981
6,000,566 is not a prime number but a composite one.
2,024,972 = 22 × 17 × 97 × 307
2,024,972 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,566 ÷ 2,024,972 = 2 + 1,950,622
Step 2. Divide the smaller number by the above operation's remainder:
2,024,972 ÷ 1,950,622 = 1 + 74,350
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,622 ÷ 74,350 = 26 + 17,522
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,350 ÷ 17,522 = 4 + 4,262
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
17,522 ÷ 4,262 = 4 + 474
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,262 ÷ 474 = 8 + 470
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
474 ÷ 470 = 1 + 4
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
470 ÷ 4 = 117 + 2
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4 ÷ 2 = 2 + 0
At this step, the remainder is zero, so we stop:
2 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,566; 2,024,972) = 2
The two numbers have common prime factors