Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,100; 200,000,000,738) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,100 = 22 × 52 × 101 × 9,901
100,000,100 is not a prime number but a composite one.
200,000,000,738 = 2 × 23 × 16,103 × 270,001
200,000,000,738 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,738 ÷ 100,000,100 = 1,999 + 99,800,838
Step 2. Divide the smaller number by the above operation's remainder:
100,000,100 ÷ 99,800,838 = 1 + 199,262
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,800,838 ÷ 199,262 = 500 + 169,838
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
199,262 ÷ 169,838 = 1 + 29,424
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
169,838 ÷ 29,424 = 5 + 22,718
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
29,424 ÷ 22,718 = 1 + 6,706
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
22,718 ÷ 6,706 = 3 + 2,600
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,706 ÷ 2,600 = 2 + 1,506
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,600 ÷ 1,506 = 1 + 1,094
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,506 ÷ 1,094 = 1 + 412
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,094 ÷ 412 = 2 + 270
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
412 ÷ 270 = 1 + 142
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
270 ÷ 142 = 1 + 128
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
142 ÷ 128 = 1 + 14
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
128 ÷ 14 = 9 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
14 ÷ 2 = 7 + 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,100; 200,000,000,738) = 2
The two numbers have common prime factors