Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,198; 200,000,000,348) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,198 = 2 × 43 × 1,162,793
100,000,198 is not a prime number but a composite one.
200,000,000,348 = 22 × 2,837 × 17,624,251
200,000,000,348 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,348 ÷ 100,000,198 = 1,999 + 99,604,546
Step 2. Divide the smaller number by the above operation's remainder:
100,000,198 ÷ 99,604,546 = 1 + 395,652
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,604,546 ÷ 395,652 = 251 + 295,894
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
395,652 ÷ 295,894 = 1 + 99,758
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
295,894 ÷ 99,758 = 2 + 96,378
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
99,758 ÷ 96,378 = 1 + 3,380
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
96,378 ÷ 3,380 = 28 + 1,738
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,380 ÷ 1,738 = 1 + 1,642
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,738 ÷ 1,642 = 1 + 96
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,642 ÷ 96 = 17 + 10
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
96 ÷ 10 = 9 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
10 ÷ 6 = 1 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
6 ÷ 4 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,198; 200,000,000,348) = 2
The two numbers have common prime factors