Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,166; 200,000,000,808) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,166 = 2 × 7 × 7,142,869
100,000,166 is not a prime number but a composite one.
200,000,000,808 = 23 × 32 × 19 × 29 × 1,571 × 3,209
200,000,000,808 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,808 ÷ 100,000,166 = 1,999 + 99,668,974
Step 2. Divide the smaller number by the above operation's remainder:
100,000,166 ÷ 99,668,974 = 1 + 331,192
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,668,974 ÷ 331,192 = 300 + 311,374
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
331,192 ÷ 311,374 = 1 + 19,818
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
311,374 ÷ 19,818 = 15 + 14,104
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
19,818 ÷ 14,104 = 1 + 5,714
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,104 ÷ 5,714 = 2 + 2,676
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,714 ÷ 2,676 = 2 + 362
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,676 ÷ 362 = 7 + 142
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
362 ÷ 142 = 2 + 78
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
142 ÷ 78 = 1 + 64
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
78 ÷ 64 = 1 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
64 ÷ 14 = 4 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 8 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 6 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 2 = 3 + 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,166; 200,000,000,808) = 2
The two numbers have common prime factors