Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,948; 200,000,000,846) = ?
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,846 = 2 × 19 × 23,143 × 227,419
200,000,000,846 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,846 ÷ 99,999,948 = 2,000 + 104,846
Step 2. Divide the smaller number by the above operation's remainder:
99,999,948 ÷ 104,846 = 953 + 81,710
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
104,846 ÷ 81,710 = 1 + 23,136
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
81,710 ÷ 23,136 = 3 + 12,302
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
23,136 ÷ 12,302 = 1 + 10,834
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
12,302 ÷ 10,834 = 1 + 1,468
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,834 ÷ 1,468 = 7 + 558
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,468 ÷ 558 = 2 + 352
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
558 ÷ 352 = 1 + 206
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
352 ÷ 206 = 1 + 146
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
206 ÷ 146 = 1 + 60
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
146 ÷ 60 = 2 + 26
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
60 ÷ 26 = 2 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
26 ÷ 8 = 3 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 2 = 4 + 0
At this step, the remainder is zero, so we stop:
2 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,846) = 2
The two numbers have common prime factors