Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,948; 200,000,000,344) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,948 = 22 × 3 × 8,333,329
99,999,948 is not a prime number but a composite one.
200,000,000,344 = 23 × 29 × 67 × 2,377 × 5,413
200,000,000,344 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,344 ÷ 99,999,948 = 2,000 + 104,344
Step 2. Divide the smaller number by the above operation's remainder:
99,999,948 ÷ 104,344 = 958 + 38,396
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
104,344 ÷ 38,396 = 2 + 27,552
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
38,396 ÷ 27,552 = 1 + 10,844
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
27,552 ÷ 10,844 = 2 + 5,864
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
10,844 ÷ 5,864 = 1 + 4,980
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,864 ÷ 4,980 = 1 + 884
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,980 ÷ 884 = 5 + 560
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
884 ÷ 560 = 1 + 324
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
560 ÷ 324 = 1 + 236
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
324 ÷ 236 = 1 + 88
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
236 ÷ 88 = 2 + 60
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
88 ÷ 60 = 1 + 28
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
60 ÷ 28 = 2 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
28 ÷ 4 = 7 + 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,948; 200,000,000,344) = 4 = 22
The two numbers have common prime factors