Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,330; 2,024,928) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,330 = 2 × 3 × 5 × 7 × 28,573
6,000,330 is not a prime number but a composite one.
2,024,928 = 25 × 32 × 79 × 89
2,024,928 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,330 ÷ 2,024,928 = 2 + 1,950,474
Step 2. Divide the smaller number by the above operation's remainder:
2,024,928 ÷ 1,950,474 = 1 + 74,454
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,474 ÷ 74,454 = 26 + 14,670
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,454 ÷ 14,670 = 5 + 1,104
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
14,670 ÷ 1,104 = 13 + 318
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,104 ÷ 318 = 3 + 150
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
318 ÷ 150 = 2 + 18
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
150 ÷ 18 = 8 + 6
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
18 ÷ 6 = 3 + 0
At this step, the remainder is zero, so we stop:
6 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,330; 2,024,928) = 6 = 2 × 3
The two numbers have common prime factors