Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,918; 200,000,000,841) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,918 = 2 × 32 × 773 × 7,187
99,999,918 is not a prime number but a composite one.
200,000,000,841 = 3 × 41 × 1,626,016,267
200,000,000,841 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,841 ÷ 99,999,918 = 2,000 + 164,841
Step 2. Divide the smaller number by the above operation's remainder:
99,999,918 ÷ 164,841 = 606 + 106,272
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
164,841 ÷ 106,272 = 1 + 58,569
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
106,272 ÷ 58,569 = 1 + 47,703
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
58,569 ÷ 47,703 = 1 + 10,866
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
47,703 ÷ 10,866 = 4 + 4,239
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,866 ÷ 4,239 = 2 + 2,388
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,239 ÷ 2,388 = 1 + 1,851
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,388 ÷ 1,851 = 1 + 537
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,851 ÷ 537 = 3 + 240
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
537 ÷ 240 = 2 + 57
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
240 ÷ 57 = 4 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
57 ÷ 12 = 4 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 9 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
9 ÷ 3 = 3 + 0
At this step, the remainder is zero, so we stop:
3 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,918; 200,000,000,841) = 3
The two numbers have common prime factors