Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,041; 199,999,999,989) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,041 = 3 × 33,333,347
100,000,041 is not a prime number but a composite one.
199,999,999,989 = 33 × 56,239 × 131,713
199,999,999,989 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:
199,999,999,989 ÷ 100,000,041 = 1,999 + 99,918,030
Step 2. Divide the smaller number by the above operation's remainder:
100,000,041 ÷ 99,918,030 = 1 + 82,011
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,918,030 ÷ 82,011 = 1,218 + 28,632
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
82,011 ÷ 28,632 = 2 + 24,747
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
28,632 ÷ 24,747 = 1 + 3,885
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
24,747 ÷ 3,885 = 6 + 1,437
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,885 ÷ 1,437 = 2 + 1,011
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,437 ÷ 1,011 = 1 + 426
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,011 ÷ 426 = 2 + 159
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
426 ÷ 159 = 2 + 108
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
159 ÷ 108 = 1 + 51
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
108 ÷ 51 = 2 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
51 ÷ 6 = 8 + 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,041; 199,999,999,989) = 3
The two numbers have common prime factors