Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,092; 200,000,000,157) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,092 = 22 × 3 × 71 × 117,371
100,000,092 is not a prime number but a composite one.
200,000,000,157 = 3 × 89 × 749,063,671
200,000,000,157 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,157 ÷ 100,000,092 = 1,999 + 99,816,249
Step 2. Divide the smaller number by the above operation's remainder:
100,000,092 ÷ 99,816,249 = 1 + 183,843
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,816,249 ÷ 183,843 = 542 + 173,343
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
183,843 ÷ 173,343 = 1 + 10,500
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
173,343 ÷ 10,500 = 16 + 5,343
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
10,500 ÷ 5,343 = 1 + 5,157
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,343 ÷ 5,157 = 1 + 186
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,157 ÷ 186 = 27 + 135
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
186 ÷ 135 = 1 + 51
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
135 ÷ 51 = 2 + 33
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
51 ÷ 33 = 1 + 18
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
33 ÷ 18 = 1 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
18 ÷ 15 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 3 = 5 + 0
At this step, the remainder is zero, so we stop:
3 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,092; 200,000,000,157) = 3
The two numbers have common prime factors