Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,741; 200,000,000,331) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,741 = 3 × 33,333,247
99,999,741 is not a prime number but a composite one.
200,000,000,331 = 32 × 3,617 × 6,143,827
200,000,000,331 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,331 ÷ 99,999,741 = 2,000 + 518,331
Step 2. Divide the smaller number by the above operation's remainder:
99,999,741 ÷ 518,331 = 192 + 480,189
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
518,331 ÷ 480,189 = 1 + 38,142
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
480,189 ÷ 38,142 = 12 + 22,485
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
38,142 ÷ 22,485 = 1 + 15,657
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
22,485 ÷ 15,657 = 1 + 6,828
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,657 ÷ 6,828 = 2 + 2,001
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,828 ÷ 2,001 = 3 + 825
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,001 ÷ 825 = 2 + 351
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
825 ÷ 351 = 2 + 123
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
351 ÷ 123 = 2 + 105
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
123 ÷ 105 = 1 + 18
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
105 ÷ 18 = 5 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
18 ÷ 15 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
15 ÷ 3 = 5 + 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 (99,999,741; 200,000,000,331) = 3
The two numbers have common prime factors