Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,075; 199,999,999,970) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,075 = 52 × 7 × 139 × 4,111
100,000,075 is not a prime number but a composite one.
199,999,999,970 = 2 × 5 × 43 × 337 × 1,123 × 1,229
199,999,999,970 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:
199,999,999,970 ÷ 100,000,075 = 1,999 + 99,850,045
Step 2. Divide the smaller number by the above operation's remainder:
100,000,075 ÷ 99,850,045 = 1 + 150,030
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,850,045 ÷ 150,030 = 665 + 80,095
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
150,030 ÷ 80,095 = 1 + 69,935
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
80,095 ÷ 69,935 = 1 + 10,160
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
69,935 ÷ 10,160 = 6 + 8,975
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,160 ÷ 8,975 = 1 + 1,185
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,975 ÷ 1,185 = 7 + 680
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,185 ÷ 680 = 1 + 505
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
680 ÷ 505 = 1 + 175
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
505 ÷ 175 = 2 + 155
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
175 ÷ 155 = 1 + 20
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
155 ÷ 20 = 7 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
20 ÷ 15 = 1 + 5
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
15 ÷ 5 = 3 + 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,075; 199,999,999,970) = 5
The two numbers have common prime factors