Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,884; 200,000,000,640) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,884 = 22 × 24,999,971
99,999,884 is not a prime number but a composite one.
200,000,000,640 = 27 × 3 × 5 × 11 × 17 × 557,041
200,000,000,640 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,640 ÷ 99,999,884 = 2,000 + 232,640
Step 2. Divide the smaller number by the above operation's remainder:
99,999,884 ÷ 232,640 = 429 + 197,324
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
232,640 ÷ 197,324 = 1 + 35,316
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
197,324 ÷ 35,316 = 5 + 20,744
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
35,316 ÷ 20,744 = 1 + 14,572
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
20,744 ÷ 14,572 = 1 + 6,172
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,572 ÷ 6,172 = 2 + 2,228
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,172 ÷ 2,228 = 2 + 1,716
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,228 ÷ 1,716 = 1 + 512
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,716 ÷ 512 = 3 + 180
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
512 ÷ 180 = 2 + 152
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
180 ÷ 152 = 1 + 28
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
152 ÷ 28 = 5 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
28 ÷ 12 = 2 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 4 = 3 + 0
At this step, the remainder is zero, so we stop:
4 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,884; 200,000,000,640) = 4 = 22
The two numbers have common prime factors