Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,680; 200,000,000,125) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,680 = 26 × 5 × 11 × 28,409
99,999,680 is not a prime number but a composite one.
200,000,000,125 = 53 × 1,889 × 847,009
200,000,000,125 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,125 ÷ 99,999,680 = 2,000 + 640,125
Step 2. Divide the smaller number by the above operation's remainder:
99,999,680 ÷ 640,125 = 156 + 140,180
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
640,125 ÷ 140,180 = 4 + 79,405
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
140,180 ÷ 79,405 = 1 + 60,775
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
79,405 ÷ 60,775 = 1 + 18,630
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
60,775 ÷ 18,630 = 3 + 4,885
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
18,630 ÷ 4,885 = 3 + 3,975
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,885 ÷ 3,975 = 1 + 910
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,975 ÷ 910 = 4 + 335
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
910 ÷ 335 = 2 + 240
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
335 ÷ 240 = 1 + 95
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
240 ÷ 95 = 2 + 50
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
95 ÷ 50 = 1 + 45
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
50 ÷ 45 = 1 + 5
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
45 ÷ 5 = 9 + 0
At this step, the remainder is zero, so we stop:
5 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,680; 200,000,000,125) = 5
The two numbers have common prime factors