Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,450; 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,450 = 2 × 3 × 52 × 109 × 367
6,000,450 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,450 ÷ 2,024,910 = 2 + 1,950,630
Step 2. Divide the smaller number by the above operation's remainder:
2,024,910 ÷ 1,950,630 = 1 + 74,280
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,630 ÷ 74,280 = 26 + 19,350
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,280 ÷ 19,350 = 3 + 16,230
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
19,350 ÷ 16,230 = 1 + 3,120
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
16,230 ÷ 3,120 = 5 + 630
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,120 ÷ 630 = 4 + 600
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
630 ÷ 600 = 1 + 30
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
600 ÷ 30 = 20 + 0
At this step, the remainder is zero, so we stop:
30 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,450; 2,024,910) = 30 = 2 × 3 × 5
The two numbers have common prime factors