Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,548; 200,000,000,540) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,548 = 22 × 11 × 1,409 × 1,613
99,999,548 is not a prime number but a composite one.
200,000,000,540 = 22 × 5 × 37 × 270,270,271
200,000,000,540 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,540 ÷ 99,999,548 = 2,000 + 904,540
Step 2. Divide the smaller number by the above operation's remainder:
99,999,548 ÷ 904,540 = 110 + 500,148
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
904,540 ÷ 500,148 = 1 + 404,392
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
500,148 ÷ 404,392 = 1 + 95,756
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
404,392 ÷ 95,756 = 4 + 21,368
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
95,756 ÷ 21,368 = 4 + 10,284
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
21,368 ÷ 10,284 = 2 + 800
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
10,284 ÷ 800 = 12 + 684
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
800 ÷ 684 = 1 + 116
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
684 ÷ 116 = 5 + 104
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
116 ÷ 104 = 1 + 12
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
104 ÷ 12 = 8 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
12 ÷ 8 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 4 = 2 + 0
At this step, the remainder is zero, so we stop:
4 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,548; 200,000,000,540) = 4 = 22
The two numbers have common prime factors