Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,110; 200,000,000,304) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,110 = 2 × 3 × 5 × 7 × 31 × 15,361
100,000,110 is not a prime number but a composite one.
200,000,000,304 = 24 × 32 × 13 × 127 × 841,241
200,000,000,304 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,304 ÷ 100,000,110 = 1,999 + 99,780,414
Step 2. Divide the smaller number by the above operation's remainder:
100,000,110 ÷ 99,780,414 = 1 + 219,696
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,780,414 ÷ 219,696 = 454 + 38,430
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
219,696 ÷ 38,430 = 5 + 27,546
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
38,430 ÷ 27,546 = 1 + 10,884
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
27,546 ÷ 10,884 = 2 + 5,778
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,884 ÷ 5,778 = 1 + 5,106
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,778 ÷ 5,106 = 1 + 672
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,106 ÷ 672 = 7 + 402
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
672 ÷ 402 = 1 + 270
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
402 ÷ 270 = 1 + 132
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
270 ÷ 132 = 2 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
132 ÷ 6 = 22 + 0
At this step, the remainder is zero, so we stop:
6 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,110; 200,000,000,304) = 6 = 2 × 3
The two numbers have common prime factors