Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,936; 200,000,000,547) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,936 = 26 × 32 × 139 × 1,249
99,999,936 is not a prime number but a composite one.
200,000,000,547 = 32 × 29 × 223 × 3,436,249
200,000,000,547 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,547 ÷ 99,999,936 = 2,000 + 128,547
Step 2. Divide the smaller number by the above operation's remainder:
99,999,936 ÷ 128,547 = 777 + 118,917
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
128,547 ÷ 118,917 = 1 + 9,630
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
118,917 ÷ 9,630 = 12 + 3,357
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,630 ÷ 3,357 = 2 + 2,916
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,357 ÷ 2,916 = 1 + 441
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,916 ÷ 441 = 6 + 270
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
441 ÷ 270 = 1 + 171
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
270 ÷ 171 = 1 + 99
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
171 ÷ 99 = 1 + 72
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
99 ÷ 72 = 1 + 27
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
72 ÷ 27 = 2 + 18
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
27 ÷ 18 = 1 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
18 ÷ 9 = 2 + 0
At this step, the remainder is zero, so we stop:
9 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,936; 200,000,000,547) = 9 = 32
The two numbers have common prime factors