Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,066; 200,000,000,192) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,066 = 2 × 41 × 919 × 1,327
100,000,066 is not a prime number but a composite one.
200,000,000,192 = 26 × 137 × 22,810,219
200,000,000,192 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,192 ÷ 100,000,066 = 1,999 + 99,868,258
Step 2. Divide the smaller number by the above operation's remainder:
100,000,066 ÷ 99,868,258 = 1 + 131,808
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,868,258 ÷ 131,808 = 757 + 89,602
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
131,808 ÷ 89,602 = 1 + 42,206
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
89,602 ÷ 42,206 = 2 + 5,190
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
42,206 ÷ 5,190 = 8 + 686
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,190 ÷ 686 = 7 + 388
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
686 ÷ 388 = 1 + 298
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
388 ÷ 298 = 1 + 90
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
298 ÷ 90 = 3 + 28
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
90 ÷ 28 = 3 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
28 ÷ 6 = 4 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
6 ÷ 4 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
4 ÷ 2 = 2 + 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,066; 200,000,000,192) = 2
The two numbers have common prime factors