Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,117; 200,000,000,830) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,117 = 7 × 14,285,731
100,000,117 is not a prime number but a composite one.
200,000,000,830 = 2 × 5 × 72 × 23 × 31 × 43 × 13,313
200,000,000,830 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,830 ÷ 100,000,117 = 1,999 + 99,766,947
Step 2. Divide the smaller number by the above operation's remainder:
100,000,117 ÷ 99,766,947 = 1 + 233,170
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,766,947 ÷ 233,170 = 427 + 203,357
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
233,170 ÷ 203,357 = 1 + 29,813
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
203,357 ÷ 29,813 = 6 + 24,479
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
29,813 ÷ 24,479 = 1 + 5,334
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
24,479 ÷ 5,334 = 4 + 3,143
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,334 ÷ 3,143 = 1 + 2,191
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,143 ÷ 2,191 = 1 + 952
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,191 ÷ 952 = 2 + 287
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
952 ÷ 287 = 3 + 91
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
287 ÷ 91 = 3 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
91 ÷ 14 = 6 + 7
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,117; 200,000,000,830) = 7
The two numbers have common prime factors