Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,894; 200,000,000,144) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,894 = 2 × 3 × 83 × 157 × 1,279
99,999,894 is not a prime number but a composite one.
200,000,000,144 = 24 × 72 × 41 × 47 × 132,383
200,000,000,144 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,144 ÷ 99,999,894 = 2,000 + 212,144
Step 2. Divide the smaller number by the above operation's remainder:
99,999,894 ÷ 212,144 = 471 + 80,070
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
212,144 ÷ 80,070 = 2 + 52,004
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
80,070 ÷ 52,004 = 1 + 28,066
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
52,004 ÷ 28,066 = 1 + 23,938
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
28,066 ÷ 23,938 = 1 + 4,128
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
23,938 ÷ 4,128 = 5 + 3,298
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,128 ÷ 3,298 = 1 + 830
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,298 ÷ 830 = 3 + 808
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
830 ÷ 808 = 1 + 22
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
808 ÷ 22 = 36 + 16
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
22 ÷ 16 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
16 ÷ 6 = 2 + 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,894; 200,000,000,144) = 2
The two numbers have common prime factors