Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,893; 200,000,000,186) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,893 = 7 × 31 × 460,829
99,999,893 is not a prime number but a composite one.
200,000,000,186 = 2 × 7 × 232 × 397 × 68,023
200,000,000,186 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,186 ÷ 99,999,893 = 2,000 + 214,186
Step 2. Divide the smaller number by the above operation's remainder:
99,999,893 ÷ 214,186 = 466 + 189,217
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
214,186 ÷ 189,217 = 1 + 24,969
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
189,217 ÷ 24,969 = 7 + 14,434
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
24,969 ÷ 14,434 = 1 + 10,535
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
14,434 ÷ 10,535 = 1 + 3,899
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,535 ÷ 3,899 = 2 + 2,737
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,899 ÷ 2,737 = 1 + 1,162
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,737 ÷ 1,162 = 2 + 413
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,162 ÷ 413 = 2 + 336
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
413 ÷ 336 = 1 + 77
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
336 ÷ 77 = 4 + 28
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
77 ÷ 28 = 2 + 21
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
28 ÷ 21 = 1 + 7
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
21 ÷ 7 = 3 + 0
At this step, the remainder is zero, so we stop:
7 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,893; 200,000,000,186) = 7
The two numbers have common prime factors