Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,080; 200,000,000,626) = ?
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,626 = 2 × 101 × 990,099,013
200,000,000,626 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,626 ÷ 100,000,080 = 1,999 + 99,840,706
Step 2. Divide the smaller number by the above operation's remainder:
100,000,080 ÷ 99,840,706 = 1 + 159,374
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,840,706 ÷ 159,374 = 626 + 72,582
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
159,374 ÷ 72,582 = 2 + 14,210
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
72,582 ÷ 14,210 = 5 + 1,532
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
14,210 ÷ 1,532 = 9 + 422
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,532 ÷ 422 = 3 + 266
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
422 ÷ 266 = 1 + 156
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
266 ÷ 156 = 1 + 110
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
156 ÷ 110 = 1 + 46
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
110 ÷ 46 = 2 + 18
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
46 ÷ 18 = 2 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
18 ÷ 10 = 1 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 8 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 2 = 4 + 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,626) = 2
The two numbers have common prime factors