Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,915; 200,000,000,495) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,915 = 3 × 5 × 113 × 58,997
99,999,915 is not a prime number but a composite one.
200,000,000,495 = 5 × 53 × 754,716,983
200,000,000,495 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,495 ÷ 99,999,915 = 2,000 + 170,495
Step 2. Divide the smaller number by the above operation's remainder:
99,999,915 ÷ 170,495 = 586 + 89,845
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
170,495 ÷ 89,845 = 1 + 80,650
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
89,845 ÷ 80,650 = 1 + 9,195
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
80,650 ÷ 9,195 = 8 + 7,090
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
9,195 ÷ 7,090 = 1 + 2,105
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,090 ÷ 2,105 = 3 + 775
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,105 ÷ 775 = 2 + 555
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
775 ÷ 555 = 1 + 220
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
555 ÷ 220 = 2 + 115
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
220 ÷ 115 = 1 + 105
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
115 ÷ 105 = 1 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
105 ÷ 10 = 10 + 5
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 5 = 2 + 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,915; 200,000,000,495) = 5
The two numbers have common prime factors