Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,078; 200,000,000,186) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,078 = 2 × 19 × 2,631,581
100,000,078 is not a prime number but a composite one.
200,000,000,186 = 2 × 7 × 232 × 397 × 68,023
200,000,000,186 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,186 ÷ 100,000,078 = 1,999 + 99,844,264
Step 2. Divide the smaller number by the above operation's remainder:
100,000,078 ÷ 99,844,264 = 1 + 155,814
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,844,264 ÷ 155,814 = 640 + 123,304
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
155,814 ÷ 123,304 = 1 + 32,510
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
123,304 ÷ 32,510 = 3 + 25,774
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
32,510 ÷ 25,774 = 1 + 6,736
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
25,774 ÷ 6,736 = 3 + 5,566
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,736 ÷ 5,566 = 1 + 1,170
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,566 ÷ 1,170 = 4 + 886
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,170 ÷ 886 = 1 + 284
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
886 ÷ 284 = 3 + 34
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
284 ÷ 34 = 8 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
34 ÷ 12 = 2 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 10 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 2 = 5 + 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,078; 200,000,000,186) = 2
The two numbers have common prime factors