Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,146; 200,000,000,733) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,146 = 2 × 3 × 587 × 28,393
100,000,146 is not a prime number but a composite one.
200,000,000,733 = 3 × 132 × 2,671 × 147,689
200,000,000,733 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,733 ÷ 100,000,146 = 1,999 + 99,708,879
Step 2. Divide the smaller number by the above operation's remainder:
100,000,146 ÷ 99,708,879 = 1 + 291,267
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,708,879 ÷ 291,267 = 342 + 95,565
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
291,267 ÷ 95,565 = 3 + 4,572
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
95,565 ÷ 4,572 = 20 + 4,125
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,572 ÷ 4,125 = 1 + 447
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,125 ÷ 447 = 9 + 102
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
447 ÷ 102 = 4 + 39
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
102 ÷ 39 = 2 + 24
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
39 ÷ 24 = 1 + 15
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
24 ÷ 15 = 1 + 9
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
15 ÷ 9 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
9 ÷ 6 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 3 = 2 + 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 (100,000,146; 200,000,000,733) = 3
The two numbers have common prime factors