Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,078; 200,000,000,270) = ?
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,270 = 2 × 5 × 7 × 1,637 × 1,745,353
200,000,000,270 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,270 ÷ 100,000,078 = 1,999 + 99,844,348
Step 2. Divide the smaller number by the above operation's remainder:
100,000,078 ÷ 99,844,348 = 1 + 155,730
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,844,348 ÷ 155,730 = 641 + 21,418
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
155,730 ÷ 21,418 = 7 + 5,804
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
21,418 ÷ 5,804 = 3 + 4,006
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,804 ÷ 4,006 = 1 + 1,798
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,006 ÷ 1,798 = 2 + 410
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,798 ÷ 410 = 4 + 158
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
410 ÷ 158 = 2 + 94
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
158 ÷ 94 = 1 + 64
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
94 ÷ 64 = 1 + 30
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
64 ÷ 30 = 2 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
30 ÷ 4 = 7 + 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,078; 200,000,000,270) = 2
The two numbers have common prime factors