Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,080; 200,000,000,402) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,080 = 24 × 32 × 5 × 138,889
100,000,080 is not a prime number but a composite one.
200,000,000,402 = 2 × 17 × 29 × 179 × 1,133,183
200,000,000,402 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,402 ÷ 100,000,080 = 1,999 + 99,840,482
Step 2. Divide the smaller number by the above operation's remainder:
100,000,080 ÷ 99,840,482 = 1 + 159,598
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,840,482 ÷ 159,598 = 625 + 91,732
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
159,598 ÷ 91,732 = 1 + 67,866
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
91,732 ÷ 67,866 = 1 + 23,866
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
67,866 ÷ 23,866 = 2 + 20,134
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
23,866 ÷ 20,134 = 1 + 3,732
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
20,134 ÷ 3,732 = 5 + 1,474
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,732 ÷ 1,474 = 2 + 784
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,474 ÷ 784 = 1 + 690
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
784 ÷ 690 = 1 + 94
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
690 ÷ 94 = 7 + 32
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
94 ÷ 32 = 2 + 30
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
32 ÷ 30 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
30 ÷ 2 = 15 + 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,080; 200,000,000,402) = 2
The two numbers have common prime factors