Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,197; 200,000,001,363) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,197 = 33 × 11 × 109 × 3,089
100,000,197 is not a prime number but a composite one.
200,000,001,363 = 3 × 157 × 424,628,453
200,000,001,363 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,001,363 ÷ 100,000,197 = 1,999 + 99,607,560
Step 2. Divide the smaller number by the above operation's remainder:
100,000,197 ÷ 99,607,560 = 1 + 392,637
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,607,560 ÷ 392,637 = 253 + 270,399
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
392,637 ÷ 270,399 = 1 + 122,238
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
270,399 ÷ 122,238 = 2 + 25,923
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
122,238 ÷ 25,923 = 4 + 18,546
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
25,923 ÷ 18,546 = 1 + 7,377
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
18,546 ÷ 7,377 = 2 + 3,792
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
7,377 ÷ 3,792 = 1 + 3,585
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,792 ÷ 3,585 = 1 + 207
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
3,585 ÷ 207 = 17 + 66
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
207 ÷ 66 = 3 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
66 ÷ 9 = 7 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
9 ÷ 3 = 3 + 0
At this step, the remainder is zero, so we stop:
3 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,197; 200,000,001,363) = 3
The two numbers have common prime factors