Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,098; 200,000,000,036) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,098 = 2 × 32 × 11 × 505,051
100,000,098 is not a prime number but a composite one.
200,000,000,036 = 22 × 881 × 56,753,689
200,000,000,036 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,036 ÷ 100,000,098 = 1,999 + 99,804,134
Step 2. Divide the smaller number by the above operation's remainder:
100,000,098 ÷ 99,804,134 = 1 + 195,964
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,804,134 ÷ 195,964 = 509 + 58,458
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
195,964 ÷ 58,458 = 3 + 20,590
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
58,458 ÷ 20,590 = 2 + 17,278
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
20,590 ÷ 17,278 = 1 + 3,312
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,278 ÷ 3,312 = 5 + 718
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,312 ÷ 718 = 4 + 440
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
718 ÷ 440 = 1 + 278
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
440 ÷ 278 = 1 + 162
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
278 ÷ 162 = 1 + 116
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
162 ÷ 116 = 1 + 46
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
116 ÷ 46 = 2 + 24
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
46 ÷ 24 = 1 + 22
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
24 ÷ 22 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
22 ÷ 2 = 11 + 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,098; 200,000,000,036) = 2
The two numbers have common prime factors