Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,080; 200,000,000,654) = ?
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,654 = 2 × 53 × 13,417 × 140,627
200,000,000,654 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,654 ÷ 100,000,080 = 1,999 + 99,840,734
Step 2. Divide the smaller number by the above operation's remainder:
100,000,080 ÷ 99,840,734 = 1 + 159,346
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,840,734 ÷ 159,346 = 626 + 90,138
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
159,346 ÷ 90,138 = 1 + 69,208
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
90,138 ÷ 69,208 = 1 + 20,930
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
69,208 ÷ 20,930 = 3 + 6,418
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
20,930 ÷ 6,418 = 3 + 1,676
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,418 ÷ 1,676 = 3 + 1,390
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,676 ÷ 1,390 = 1 + 286
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,390 ÷ 286 = 4 + 246
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
286 ÷ 246 = 1 + 40
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
246 ÷ 40 = 6 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
40 ÷ 6 = 6 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 4 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,080; 200,000,000,654) = 2
The two numbers have common prime factors