Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,098; 200,000,000,170) = ?
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,170 = 2 × 5 × 29 × 37 × 18,639,329
200,000,000,170 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,170 ÷ 100,000,098 = 1,999 + 99,804,268
Step 2. Divide the smaller number by the above operation's remainder:
100,000,098 ÷ 99,804,268 = 1 + 195,830
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,804,268 ÷ 195,830 = 509 + 126,798
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
195,830 ÷ 126,798 = 1 + 69,032
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
126,798 ÷ 69,032 = 1 + 57,766
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
69,032 ÷ 57,766 = 1 + 11,266
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
57,766 ÷ 11,266 = 5 + 1,436
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
11,266 ÷ 1,436 = 7 + 1,214
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,436 ÷ 1,214 = 1 + 222
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,214 ÷ 222 = 5 + 104
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
222 ÷ 104 = 2 + 14
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
104 ÷ 14 = 7 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
14 ÷ 6 = 2 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,098; 200,000,000,170) = 2
The two numbers have common prime factors