Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,975; 200,000,000,166) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,975 = 3 × 52 × 23 × 29 × 1,999
99,999,975 is not a prime number but a composite one.
200,000,000,166 = 2 × 3 × 89,659 × 371,779
200,000,000,166 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,166 ÷ 99,999,975 = 2,000 + 50,166
Step 2. Divide the smaller number by the above operation's remainder:
99,999,975 ÷ 50,166 = 1,993 + 19,137
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
50,166 ÷ 19,137 = 2 + 11,892
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
19,137 ÷ 11,892 = 1 + 7,245
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
11,892 ÷ 7,245 = 1 + 4,647
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,245 ÷ 4,647 = 1 + 2,598
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,647 ÷ 2,598 = 1 + 2,049
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,598 ÷ 2,049 = 1 + 549
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,049 ÷ 549 = 3 + 402
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
549 ÷ 402 = 1 + 147
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
402 ÷ 147 = 2 + 108
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
147 ÷ 108 = 1 + 39
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
108 ÷ 39 = 2 + 30
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
39 ÷ 30 = 1 + 9
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
30 ÷ 9 = 3 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
9 ÷ 3 = 3 + 0
At this step, the remainder is zero, so we stop:
3 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,975; 200,000,000,166) = 3
The two numbers have common prime factors