Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,098; 200,000,000,938) = ?
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,938 = 2 × 3,019 × 33,123,551
200,000,000,938 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,938 ÷ 100,000,098 = 1,999 + 99,805,036
Step 2. Divide the smaller number by the above operation's remainder:
100,000,098 ÷ 99,805,036 = 1 + 195,062
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,805,036 ÷ 195,062 = 511 + 128,354
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
195,062 ÷ 128,354 = 1 + 66,708
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
128,354 ÷ 66,708 = 1 + 61,646
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
66,708 ÷ 61,646 = 1 + 5,062
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
61,646 ÷ 5,062 = 12 + 902
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,062 ÷ 902 = 5 + 552
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
902 ÷ 552 = 1 + 350
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
552 ÷ 350 = 1 + 202
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
350 ÷ 202 = 1 + 148
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
202 ÷ 148 = 1 + 54
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
148 ÷ 54 = 2 + 40
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
54 ÷ 40 = 1 + 14
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
40 ÷ 14 = 2 + 12
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
14 ÷ 12 = 1 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
12 ÷ 2 = 6 + 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,938) = 2
The two numbers have common prime factors