Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,948; 200,000,000,512) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,948 = 22 × 3 × 8,333,329
99,999,948 is not a prime number but a composite one.
200,000,000,512 = 29 × 13 × 30,048,077
200,000,000,512 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,512 ÷ 99,999,948 = 2,000 + 104,512
Step 2. Divide the smaller number by the above operation's remainder:
99,999,948 ÷ 104,512 = 956 + 86,476
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
104,512 ÷ 86,476 = 1 + 18,036
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
86,476 ÷ 18,036 = 4 + 14,332
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
18,036 ÷ 14,332 = 1 + 3,704
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
14,332 ÷ 3,704 = 3 + 3,220
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,704 ÷ 3,220 = 1 + 484
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,220 ÷ 484 = 6 + 316
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
484 ÷ 316 = 1 + 168
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
316 ÷ 168 = 1 + 148
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
168 ÷ 148 = 1 + 20
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
148 ÷ 20 = 7 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
20 ÷ 8 = 2 + 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,948; 200,000,000,512) = 4 = 22
The two numbers have common prime factors