Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,118; 200,000,000,096) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,118 = 2 × 50,000,059
100,000,118 is not a prime number but a composite one.
200,000,000,096 = 25 × 13 × 17 × 37 × 764,339
200,000,000,096 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,096 ÷ 100,000,118 = 1,999 + 99,764,214
Step 2. Divide the smaller number by the above operation's remainder:
100,000,118 ÷ 99,764,214 = 1 + 235,904
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,764,214 ÷ 235,904 = 422 + 212,726
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
235,904 ÷ 212,726 = 1 + 23,178
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
212,726 ÷ 23,178 = 9 + 4,124
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
23,178 ÷ 4,124 = 5 + 2,558
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,124 ÷ 2,558 = 1 + 1,566
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,558 ÷ 1,566 = 1 + 992
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,566 ÷ 992 = 1 + 574
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
992 ÷ 574 = 1 + 418
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
574 ÷ 418 = 1 + 156
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
418 ÷ 156 = 2 + 106
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
156 ÷ 106 = 1 + 50
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
106 ÷ 50 = 2 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
50 ÷ 6 = 8 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 2 = 3 + 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,118; 200,000,000,096) = 2
The two numbers have common prime factors