Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,831; 200,000,000,319) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,831 = 3 × 17 × 19 × 31 × 3,329
99,999,831 is not a prime number but a composite one.
200,000,000,319 = 3 × 7 × 347 × 2,087 × 13,151
200,000,000,319 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,319 ÷ 99,999,831 = 2,000 + 338,319
Step 2. Divide the smaller number by the above operation's remainder:
99,999,831 ÷ 338,319 = 295 + 195,726
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
338,319 ÷ 195,726 = 1 + 142,593
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
195,726 ÷ 142,593 = 1 + 53,133
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
142,593 ÷ 53,133 = 2 + 36,327
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
53,133 ÷ 36,327 = 1 + 16,806
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
36,327 ÷ 16,806 = 2 + 2,715
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
16,806 ÷ 2,715 = 6 + 516
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,715 ÷ 516 = 5 + 135
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
516 ÷ 135 = 3 + 111
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
135 ÷ 111 = 1 + 24
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
111 ÷ 24 = 4 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
24 ÷ 15 = 1 + 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,831; 200,000,000,319) = 3
The two numbers have common prime factors