Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,092; 200,000,000,558) = ?
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,558 = 2 × 127 × 547 × 571 × 2,521
200,000,000,558 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,558 ÷ 100,000,092 = 1,999 + 99,816,650
Step 2. Divide the smaller number by the above operation's remainder:
100,000,092 ÷ 99,816,650 = 1 + 183,442
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,816,650 ÷ 183,442 = 544 + 24,202
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
183,442 ÷ 24,202 = 7 + 14,028
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
24,202 ÷ 14,028 = 1 + 10,174
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
14,028 ÷ 10,174 = 1 + 3,854
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,174 ÷ 3,854 = 2 + 2,466
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,854 ÷ 2,466 = 1 + 1,388
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,466 ÷ 1,388 = 1 + 1,078
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,388 ÷ 1,078 = 1 + 310
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,078 ÷ 310 = 3 + 148
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
310 ÷ 148 = 2 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
148 ÷ 14 = 10 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 8 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 6 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 2 = 3 + 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 (100,000,092; 200,000,000,558) = 2
The two numbers have common prime factors