Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,190; 200,000,000,172) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,190 = 2 × 5 × 10,000,019
100,000,190 is not a prime number but a composite one.
200,000,000,172 = 22 × 3 × 7 × 4,603 × 517,261
200,000,000,172 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,172 ÷ 100,000,190 = 1,999 + 99,620,362
Step 2. Divide the smaller number by the above operation's remainder:
100,000,190 ÷ 99,620,362 = 1 + 379,828
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,620,362 ÷ 379,828 = 262 + 105,426
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
379,828 ÷ 105,426 = 3 + 63,550
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
105,426 ÷ 63,550 = 1 + 41,876
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
63,550 ÷ 41,876 = 1 + 21,674
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
41,876 ÷ 21,674 = 1 + 20,202
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
21,674 ÷ 20,202 = 1 + 1,472
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
20,202 ÷ 1,472 = 13 + 1,066
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,472 ÷ 1,066 = 1 + 406
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,066 ÷ 406 = 2 + 254
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
406 ÷ 254 = 1 + 152
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
254 ÷ 152 = 1 + 102
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
152 ÷ 102 = 1 + 50
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
102 ÷ 50 = 2 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
50 ÷ 2 = 25 + 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,190; 200,000,000,172) = 2
The two numbers have common prime factors