Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,145; 200,000,000,295) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,145 = 5 × 7 × 73 × 39,139
100,000,145 is not a prime number but a composite one.
200,000,000,295 = 32 × 5 × 19 × 1,933 × 121,013
200,000,000,295 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,295 ÷ 100,000,145 = 1,999 + 99,710,440
Step 2. Divide the smaller number by the above operation's remainder:
100,000,145 ÷ 99,710,440 = 1 + 289,705
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,710,440 ÷ 289,705 = 344 + 51,920
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
289,705 ÷ 51,920 = 5 + 30,105
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
51,920 ÷ 30,105 = 1 + 21,815
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
30,105 ÷ 21,815 = 1 + 8,290
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
21,815 ÷ 8,290 = 2 + 5,235
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,290 ÷ 5,235 = 1 + 3,055
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,235 ÷ 3,055 = 1 + 2,180
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,055 ÷ 2,180 = 1 + 875
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,180 ÷ 875 = 2 + 430
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
875 ÷ 430 = 2 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
430 ÷ 15 = 28 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 10 = 1 + 5
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 5 = 2 + 0
At this step, the remainder is zero, so we stop:
5 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,145; 200,000,000,295) = 5
The two numbers have common prime factors