Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,480; 2,024,910) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,480 = 25 × 34 × 5 × 463
6,000,480 is not a prime number but a composite one.
2,024,910 = 2 × 32 × 5 × 149 × 151
2,024,910 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,480 ÷ 2,024,910 = 2 + 1,950,660
Step 2. Divide the smaller number by the above operation's remainder:
2,024,910 ÷ 1,950,660 = 1 + 74,250
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,660 ÷ 74,250 = 26 + 20,160
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,250 ÷ 20,160 = 3 + 13,770
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
20,160 ÷ 13,770 = 1 + 6,390
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,770 ÷ 6,390 = 2 + 990
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,390 ÷ 990 = 6 + 450
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
990 ÷ 450 = 2 + 90
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
450 ÷ 90 = 5 + 0
At this step, the remainder is zero, so we stop:
90 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,480; 2,024,910) = 90 = 2 × 32 × 5
The two numbers have common prime factors