Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,515; 2,024,920) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,515 = 5 × 31 × 38,713
6,000,515 is not a prime number but a composite one.
2,024,920 = 23 × 5 × 23 × 31 × 71
2,024,920 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,515 ÷ 2,024,920 = 2 + 1,950,675
Step 2. Divide the smaller number by the above operation's remainder:
2,024,920 ÷ 1,950,675 = 1 + 74,245
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,675 ÷ 74,245 = 26 + 20,305
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,245 ÷ 20,305 = 3 + 13,330
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
20,305 ÷ 13,330 = 1 + 6,975
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,330 ÷ 6,975 = 1 + 6,355
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,975 ÷ 6,355 = 1 + 620
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,355 ÷ 620 = 10 + 155
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
620 ÷ 155 = 4 + 0
At this step, the remainder is zero, so we stop:
155 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,515; 2,024,920) = 155 = 5 × 31
The two numbers have common prime factors