Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,555; 2,024,915) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,555 = 3 × 5 × 11 × 41 × 887
6,000,555 is not a prime number but a composite one.
2,024,915 = 5 × 404,983
2,024,915 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,555 ÷ 2,024,915 = 2 + 1,950,725
Step 2. Divide the smaller number by the above operation's remainder:
2,024,915 ÷ 1,950,725 = 1 + 74,190
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,725 ÷ 74,190 = 26 + 21,785
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,190 ÷ 21,785 = 3 + 8,835
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
21,785 ÷ 8,835 = 2 + 4,115
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,835 ÷ 4,115 = 2 + 605
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,115 ÷ 605 = 6 + 485
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
605 ÷ 485 = 1 + 120
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
485 ÷ 120 = 4 + 5
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
120 ÷ 5 = 24 + 0
At this step, the remainder is zero, so we stop:
5 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,555; 2,024,915) = 5
The two numbers have common prime factors