Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,920; 200,000,000,700) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,920 = 24 × 5 × 1,249,999
99,999,920 is not a prime number but a composite one.
200,000,000,700 = 22 × 32 × 52 × 449 × 494,927
200,000,000,700 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,700 ÷ 99,999,920 = 2,000 + 160,700
Step 2. Divide the smaller number by the above operation's remainder:
99,999,920 ÷ 160,700 = 622 + 44,520
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
160,700 ÷ 44,520 = 3 + 27,140
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
44,520 ÷ 27,140 = 1 + 17,380
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
27,140 ÷ 17,380 = 1 + 9,760
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
17,380 ÷ 9,760 = 1 + 7,620
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,760 ÷ 7,620 = 1 + 2,140
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,620 ÷ 2,140 = 3 + 1,200
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,140 ÷ 1,200 = 1 + 940
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,200 ÷ 940 = 1 + 260
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
940 ÷ 260 = 3 + 160
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
260 ÷ 160 = 1 + 100
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
160 ÷ 100 = 1 + 60
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
100 ÷ 60 = 1 + 40
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
60 ÷ 40 = 1 + 20
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
40 ÷ 20 = 2 + 0
At this step, the remainder is zero, so we stop:
20 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 (99,999,920; 200,000,000,700) = 20 = 22 × 5
The two numbers have common prime factors