Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,786; 199,999,999,922) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,786 = 2 × 3 × 16,666,631
99,999,786 is not a prime number but a composite one.
199,999,999,922 = 2 × 197 × 787 × 644,999
199,999,999,922 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,922 ÷ 99,999,786 = 2,000 + 427,922
Step 2. Divide the smaller number by the above operation's remainder:
99,999,786 ÷ 427,922 = 233 + 293,960
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
427,922 ÷ 293,960 = 1 + 133,962
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
293,960 ÷ 133,962 = 2 + 26,036
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
133,962 ÷ 26,036 = 5 + 3,782
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
26,036 ÷ 3,782 = 6 + 3,344
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,782 ÷ 3,344 = 1 + 438
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,344 ÷ 438 = 7 + 278
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
438 ÷ 278 = 1 + 160
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
278 ÷ 160 = 1 + 118
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
160 ÷ 118 = 1 + 42
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
118 ÷ 42 = 2 + 34
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
42 ÷ 34 = 1 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
34 ÷ 8 = 4 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 2 = 4 + 0
At this step, the remainder is zero, so we stop:
2 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,786; 199,999,999,922) = 2
The two numbers have common prime factors