Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,113; 200,000,000,106) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,113 = 3 × 23 × 67 × 97 × 223
100,000,113 is not a prime number but a composite one.
200,000,000,106 = 2 × 32 × 1,021 × 10,882,577
200,000,000,106 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,106 ÷ 100,000,113 = 1,999 + 99,774,219
Step 2. Divide the smaller number by the above operation's remainder:
100,000,113 ÷ 99,774,219 = 1 + 225,894
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,774,219 ÷ 225,894 = 441 + 154,965
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
225,894 ÷ 154,965 = 1 + 70,929
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
154,965 ÷ 70,929 = 2 + 13,107
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
70,929 ÷ 13,107 = 5 + 5,394
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
13,107 ÷ 5,394 = 2 + 2,319
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,394 ÷ 2,319 = 2 + 756
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,319 ÷ 756 = 3 + 51
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
756 ÷ 51 = 14 + 42
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
51 ÷ 42 = 1 + 9
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
42 ÷ 9 = 4 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
9 ÷ 6 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 3 = 2 + 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,113; 200,000,000,106) = 3
The two numbers have common prime factors