Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,092; 200,000,000,187) = ?
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,187 = 32 × 13 × 1,091 × 1,566,821
200,000,000,187 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,187 ÷ 100,000,092 = 1,999 + 99,816,279
Step 2. Divide the smaller number by the above operation's remainder:
100,000,092 ÷ 99,816,279 = 1 + 183,813
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,816,279 ÷ 183,813 = 543 + 5,820
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
183,813 ÷ 5,820 = 31 + 3,393
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
5,820 ÷ 3,393 = 1 + 2,427
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,393 ÷ 2,427 = 1 + 966
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,427 ÷ 966 = 2 + 495
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
966 ÷ 495 = 1 + 471
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
495 ÷ 471 = 1 + 24
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
471 ÷ 24 = 19 + 15
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
24 ÷ 15 = 1 + 9
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
15 ÷ 9 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
9 ÷ 6 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 3 = 2 + 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,187) = 3
The two numbers have common prime factors