Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,044; 200,000,000,151) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,044 = 22 × 32 × 232 × 59 × 89
100,000,044 is not a prime number but a composite one.
200,000,000,151 = 33 × 7 × 1,058,201,059
200,000,000,151 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,151 ÷ 100,000,044 = 1,999 + 99,912,195
Step 2. Divide the smaller number by the above operation's remainder:
100,000,044 ÷ 99,912,195 = 1 + 87,849
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,912,195 ÷ 87,849 = 1,137 + 27,882
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
87,849 ÷ 27,882 = 3 + 4,203
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
27,882 ÷ 4,203 = 6 + 2,664
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,203 ÷ 2,664 = 1 + 1,539
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,664 ÷ 1,539 = 1 + 1,125
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,539 ÷ 1,125 = 1 + 414
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,125 ÷ 414 = 2 + 297
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
414 ÷ 297 = 1 + 117
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
297 ÷ 117 = 2 + 63
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
117 ÷ 63 = 1 + 54
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
63 ÷ 54 = 1 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
54 ÷ 9 = 6 + 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 (100,000,044; 200,000,000,151) = 9 = 32
The two numbers have common prime factors