Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,075; 200,000,000,886) = ?
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.
200,000,000,886 = 2 × 3 × 7 × 6,131 × 776,693
200,000,000,886 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,886 ÷ 100,000,075 = 1,999 + 99,850,961
Step 2. Divide the smaller number by the above operation's remainder:
100,000,075 ÷ 99,850,961 = 1 + 149,114
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,850,961 ÷ 149,114 = 669 + 93,695
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
149,114 ÷ 93,695 = 1 + 55,419
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
93,695 ÷ 55,419 = 1 + 38,276
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
55,419 ÷ 38,276 = 1 + 17,143
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
38,276 ÷ 17,143 = 2 + 3,990
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
17,143 ÷ 3,990 = 4 + 1,183
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,990 ÷ 1,183 = 3 + 441
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,183 ÷ 441 = 2 + 301
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
441 ÷ 301 = 1 + 140
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
301 ÷ 140 = 2 + 21
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
140 ÷ 21 = 6 + 14
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
21 ÷ 14 = 1 + 7
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
14 ÷ 7 = 2 + 0
At this step, the remainder is zero, so we stop:
7 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; 200,000,000,886) = 7
The two numbers have common prime factors