Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,882; 200,000,000,302) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,882 = 2 × 32 × 17 × 173 × 1,889
99,999,882 is not a prime number but a composite one.
200,000,000,302 = 2 × 5,309 × 18,835,939
200,000,000,302 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,302 ÷ 99,999,882 = 2,000 + 236,302
Step 2. Divide the smaller number by the above operation's remainder:
99,999,882 ÷ 236,302 = 423 + 44,136
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
236,302 ÷ 44,136 = 5 + 15,622
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
44,136 ÷ 15,622 = 2 + 12,892
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
15,622 ÷ 12,892 = 1 + 2,730
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
12,892 ÷ 2,730 = 4 + 1,972
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,730 ÷ 1,972 = 1 + 758
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,972 ÷ 758 = 2 + 456
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
758 ÷ 456 = 1 + 302
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
456 ÷ 302 = 1 + 154
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
302 ÷ 154 = 1 + 148
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
154 ÷ 148 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
148 ÷ 6 = 24 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 4 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 0
At this step, the remainder is zero, so we stop:
2 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,882; 200,000,000,302) = 2
The two numbers have common prime factors