Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,098; 200,000,000,198) = ?
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,198 = 2 × 17 × 5,882,352,947
200,000,000,198 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,198 ÷ 100,000,098 = 1,999 + 99,804,296
Step 2. Divide the smaller number by the above operation's remainder:
100,000,098 ÷ 99,804,296 = 1 + 195,802
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,804,296 ÷ 195,802 = 509 + 141,078
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
195,802 ÷ 141,078 = 1 + 54,724
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
141,078 ÷ 54,724 = 2 + 31,630
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
54,724 ÷ 31,630 = 1 + 23,094
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
31,630 ÷ 23,094 = 1 + 8,536
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
23,094 ÷ 8,536 = 2 + 6,022
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
8,536 ÷ 6,022 = 1 + 2,514
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
6,022 ÷ 2,514 = 2 + 994
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,514 ÷ 994 = 2 + 526
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
994 ÷ 526 = 1 + 468
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
526 ÷ 468 = 1 + 58
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
468 ÷ 58 = 8 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
58 ÷ 4 = 14 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
4 ÷ 2 = 2 + 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,198) = 2
The two numbers have common prime factors