Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,903; 200,000,000,685) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,903 = 3 × 2,741 × 12,161
99,999,903 is not a prime number but a composite one.
200,000,000,685 = 3 × 5 × 127 × 5,417 × 19,381
200,000,000,685 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,685 ÷ 99,999,903 = 2,000 + 194,685
Step 2. Divide the smaller number by the above operation's remainder:
99,999,903 ÷ 194,685 = 513 + 126,498
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
194,685 ÷ 126,498 = 1 + 68,187
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
126,498 ÷ 68,187 = 1 + 58,311
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
68,187 ÷ 58,311 = 1 + 9,876
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
58,311 ÷ 9,876 = 5 + 8,931
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,876 ÷ 8,931 = 1 + 945
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,931 ÷ 945 = 9 + 426
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
945 ÷ 426 = 2 + 93
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
426 ÷ 93 = 4 + 54
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
93 ÷ 54 = 1 + 39
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
54 ÷ 39 = 1 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
39 ÷ 15 = 2 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 9 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
9 ÷ 6 = 1 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 3 = 2 + 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,903; 200,000,000,685) = 3
The two numbers have common prime factors