Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,960; 200,000,000,331) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,960 = 23 × 3 × 5 × 191 × 4,363
99,999,960 is not a prime number but a composite one.
200,000,000,331 = 32 × 3,617 × 6,143,827
200,000,000,331 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,331 ÷ 99,999,960 = 2,000 + 80,331
Step 2. Divide the smaller number by the above operation's remainder:
99,999,960 ÷ 80,331 = 1,244 + 68,196
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
80,331 ÷ 68,196 = 1 + 12,135
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
68,196 ÷ 12,135 = 5 + 7,521
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
12,135 ÷ 7,521 = 1 + 4,614
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,521 ÷ 4,614 = 1 + 2,907
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,614 ÷ 2,907 = 1 + 1,707
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,907 ÷ 1,707 = 1 + 1,200
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,707 ÷ 1,200 = 1 + 507
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,200 ÷ 507 = 2 + 186
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
507 ÷ 186 = 2 + 135
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
186 ÷ 135 = 1 + 51
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
135 ÷ 51 = 2 + 33
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
51 ÷ 33 = 1 + 18
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
33 ÷ 18 = 1 + 15
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
18 ÷ 15 = 1 + 3
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
15 ÷ 3 = 5 + 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,960; 200,000,000,331) = 3
The two numbers have common prime factors