Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,948; 200,000,000,154) = ?
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,154 = 2 × 3 × 3,187 × 10,459,157
200,000,000,154 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,154 ÷ 99,999,948 = 2,000 + 104,154
Step 2. Divide the smaller number by the above operation's remainder:
99,999,948 ÷ 104,154 = 960 + 12,108
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
104,154 ÷ 12,108 = 8 + 7,290
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
12,108 ÷ 7,290 = 1 + 4,818
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
7,290 ÷ 4,818 = 1 + 2,472
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,818 ÷ 2,472 = 1 + 2,346
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,472 ÷ 2,346 = 1 + 126
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,346 ÷ 126 = 18 + 78
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
126 ÷ 78 = 1 + 48
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
78 ÷ 48 = 1 + 30
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
48 ÷ 30 = 1 + 18
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
30 ÷ 18 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
18 ÷ 12 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 6 = 2 + 0
At this step, the remainder is zero, so we stop:
6 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,154) = 6 = 2 × 3
The two numbers have common prime factors