Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,215; 2,024,955) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,215 = 5 × 13 × 92,311
6,000,215 is not a prime number but a composite one.
2,024,955 = 32 × 5 × 17 × 2,647
2,024,955 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,215 ÷ 2,024,955 = 2 + 1,950,305
Step 2. Divide the smaller number by the above operation's remainder:
2,024,955 ÷ 1,950,305 = 1 + 74,650
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,305 ÷ 74,650 = 26 + 9,405
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,650 ÷ 9,405 = 7 + 8,815
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,405 ÷ 8,815 = 1 + 590
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,815 ÷ 590 = 14 + 555
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
590 ÷ 555 = 1 + 35
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
555 ÷ 35 = 15 + 30
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
35 ÷ 30 = 1 + 5
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
30 ÷ 5 = 6 + 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,215; 2,024,955) = 5
The two numbers have common prime factors