Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,075; 2,024,901) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,075 = 34 × 52 × 2,963
6,000,075 is not a prime number but a composite one.
2,024,901 = 32 × 47 × 4,787
2,024,901 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,075 ÷ 2,024,901 = 2 + 1,950,273
Step 2. Divide the smaller number by the above operation's remainder:
2,024,901 ÷ 1,950,273 = 1 + 74,628
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,273 ÷ 74,628 = 26 + 9,945
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,628 ÷ 9,945 = 7 + 5,013
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,945 ÷ 5,013 = 1 + 4,932
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,013 ÷ 4,932 = 1 + 81
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,932 ÷ 81 = 60 + 72
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
81 ÷ 72 = 1 + 9
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
72 ÷ 9 = 8 + 0
At this step, the remainder is zero, so we stop:
9 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,075; 2,024,901) = 9 = 32
The two numbers have common prime factors