Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,886; 199,999,999,934) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,886 = 2 × 72 × 1,020,407
99,999,886 is not a prime number but a composite one.
199,999,999,934 = 2 × 7 × 19 × 2,591 × 290,189
199,999,999,934 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:
199,999,999,934 ÷ 99,999,886 = 2,000 + 227,934
Step 2. Divide the smaller number by the above operation's remainder:
99,999,886 ÷ 227,934 = 438 + 164,794
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
227,934 ÷ 164,794 = 1 + 63,140
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
164,794 ÷ 63,140 = 2 + 38,514
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
63,140 ÷ 38,514 = 1 + 24,626
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
38,514 ÷ 24,626 = 1 + 13,888
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
24,626 ÷ 13,888 = 1 + 10,738
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
13,888 ÷ 10,738 = 1 + 3,150
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
10,738 ÷ 3,150 = 3 + 1,288
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,150 ÷ 1,288 = 2 + 574
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,288 ÷ 574 = 2 + 140
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
574 ÷ 140 = 4 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
140 ÷ 14 = 10 + 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 (99,999,886; 199,999,999,934) = 14 = 2 × 7
The two numbers have common prime factors