Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,167; 200,000,001,006) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,167 = 3 × 61 × 107 × 5,107
100,000,167 is not a prime number but a composite one.
200,000,001,006 = 2 × 32 × 13 × 3,557 × 240,287
200,000,001,006 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,006 ÷ 100,000,167 = 1,999 + 99,667,173
Step 2. Divide the smaller number by the above operation's remainder:
100,000,167 ÷ 99,667,173 = 1 + 332,994
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,667,173 ÷ 332,994 = 299 + 101,967
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
332,994 ÷ 101,967 = 3 + 27,093
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
101,967 ÷ 27,093 = 3 + 20,688
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
27,093 ÷ 20,688 = 1 + 6,405
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
20,688 ÷ 6,405 = 3 + 1,473
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,405 ÷ 1,473 = 4 + 513
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,473 ÷ 513 = 2 + 447
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
513 ÷ 447 = 1 + 66
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
447 ÷ 66 = 6 + 51
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
66 ÷ 51 = 1 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
51 ÷ 15 = 3 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 6 = 2 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,167; 200,000,001,006) = 3
The two numbers have common prime factors