Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,505; 2,024,945) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,505 = 5 × 7 × 173 × 991
6,000,505 is not a prime number but a composite one.
2,024,945 = 5 × 13 × 31,153
2,024,945 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,505 ÷ 2,024,945 = 2 + 1,950,615
Step 2. Divide the smaller number by the above operation's remainder:
2,024,945 ÷ 1,950,615 = 1 + 74,330
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,615 ÷ 74,330 = 26 + 18,035
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,330 ÷ 18,035 = 4 + 2,190
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
18,035 ÷ 2,190 = 8 + 515
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
2,190 ÷ 515 = 4 + 130
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
515 ÷ 130 = 3 + 125
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
130 ÷ 125 = 1 + 5
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
125 ÷ 5 = 25 + 0
At this step, the remainder is zero, so we stop:
5 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,505; 2,024,945) = 5
The two numbers have common prime factors