Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,690; 200,000,000,275) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,690 = 2 × 3 × 5 × 72 × 59 × 1,153
99,999,690 is not a prime number but a composite one.
200,000,000,275 = 52 × 8,000,000,011
200,000,000,275 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,275 ÷ 99,999,690 = 2,000 + 620,275
Step 2. Divide the smaller number by the above operation's remainder:
99,999,690 ÷ 620,275 = 161 + 135,415
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
620,275 ÷ 135,415 = 4 + 78,615
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
135,415 ÷ 78,615 = 1 + 56,800
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
78,615 ÷ 56,800 = 1 + 21,815
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
56,800 ÷ 21,815 = 2 + 13,170
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
21,815 ÷ 13,170 = 1 + 8,645
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
13,170 ÷ 8,645 = 1 + 4,525
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
8,645 ÷ 4,525 = 1 + 4,120
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4,525 ÷ 4,120 = 1 + 405
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
4,120 ÷ 405 = 10 + 70
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
405 ÷ 70 = 5 + 55
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
70 ÷ 55 = 1 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
55 ÷ 15 = 3 + 10
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
15 ÷ 10 = 1 + 5
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
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,690; 200,000,000,275) = 5
The two numbers have common prime factors