Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,116; 200,000,000,606) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,116 = 22 × 33 × 19 × 48,733
100,000,116 is not a prime number but a composite one.
200,000,000,606 = 2 × 7 × 17 × 840,336,137
200,000,000,606 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,606 ÷ 100,000,116 = 1,999 + 99,768,722
Step 2. Divide the smaller number by the above operation's remainder:
100,000,116 ÷ 99,768,722 = 1 + 231,394
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,768,722 ÷ 231,394 = 431 + 37,908
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
231,394 ÷ 37,908 = 6 + 3,946
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
37,908 ÷ 3,946 = 9 + 2,394
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,946 ÷ 2,394 = 1 + 1,552
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,394 ÷ 1,552 = 1 + 842
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,552 ÷ 842 = 1 + 710
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
842 ÷ 710 = 1 + 132
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
710 ÷ 132 = 5 + 50
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
132 ÷ 50 = 2 + 32
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
50 ÷ 32 = 1 + 18
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
32 ÷ 18 = 1 + 14
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
18 ÷ 14 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
14 ÷ 4 = 3 + 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,116; 200,000,000,606) = 2
The two numbers have common prime factors