Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,022; 2,024,918) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,022 = 2 × 7 × 41 × 10,453
6,000,022 is not a prime number but a composite one.
2,024,918 = 2 × 7 × 53 × 2,729
2,024,918 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,022 ÷ 2,024,918 = 2 + 1,950,186
Step 2. Divide the smaller number by the above operation's remainder:
2,024,918 ÷ 1,950,186 = 1 + 74,732
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,186 ÷ 74,732 = 26 + 7,154
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,732 ÷ 7,154 = 10 + 3,192
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
7,154 ÷ 3,192 = 2 + 770
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,192 ÷ 770 = 4 + 112
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
770 ÷ 112 = 6 + 98
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
112 ÷ 98 = 1 + 14
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
98 ÷ 14 = 7 + 0
At this step, the remainder is zero, so we stop:
14 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,022; 2,024,918) = 14 = 2 × 7
The two numbers have common prime factors