Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,107; 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,107 = 32 × 41 × 271,003
100,000,107 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,107 = 1,999 + 99,786,411
Step 2. Divide the smaller number by the above operation's remainder:
100,000,107 ÷ 99,786,411 = 1 + 213,696
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,786,411 ÷ 213,696 = 466 + 204,075
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
213,696 ÷ 204,075 = 1 + 9,621
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
204,075 ÷ 9,621 = 21 + 2,034
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,621 ÷ 2,034 = 4 + 1,485
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,034 ÷ 1,485 = 1 + 549
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,485 ÷ 549 = 2 + 387
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
549 ÷ 387 = 1 + 162
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
387 ÷ 162 = 2 + 63
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
162 ÷ 63 = 2 + 36
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
63 ÷ 36 = 1 + 27
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
36 ÷ 27 = 1 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
27 ÷ 9 = 3 + 0
At this step, the remainder is zero, so we stop:
9 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,107; 200,000,000,304) = 9 = 32
The two numbers have common prime factors