Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,222; 200,000,000,942) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,222 = 2 × 7 × 17 × 89 × 4,721
100,000,222 is not a prime number but a composite one.
200,000,000,942 = 2 × 7 × 659 × 21,677,867
200,000,000,942 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:
200,000,000,942 ÷ 100,000,222 = 1,999 + 99,557,164
Step 2. Divide the smaller number by the above operation's remainder:
100,000,222 ÷ 99,557,164 = 1 + 443,058
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,557,164 ÷ 443,058 = 224 + 312,172
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
443,058 ÷ 312,172 = 1 + 130,886
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
312,172 ÷ 130,886 = 2 + 50,400
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
130,886 ÷ 50,400 = 2 + 30,086
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
50,400 ÷ 30,086 = 1 + 20,314
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
30,086 ÷ 20,314 = 1 + 9,772
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
20,314 ÷ 9,772 = 2 + 770
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
9,772 ÷ 770 = 12 + 532
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
770 ÷ 532 = 1 + 238
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
532 ÷ 238 = 2 + 56
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
238 ÷ 56 = 4 + 14
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
56 ÷ 14 = 4 + 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 (100,000,222; 200,000,000,942) = 14 = 2 × 7
The two numbers have common prime factors