Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,837; 199,999,999,905) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,837 = 32 × 72 × 23 × 9,859
99,999,837 is not a prime number but a composite one.
199,999,999,905 = 3 × 5 × 229 × 58,224,163
199,999,999,905 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,905 ÷ 99,999,837 = 2,000 + 325,905
Step 2. Divide the smaller number by the above operation's remainder:
99,999,837 ÷ 325,905 = 306 + 272,907
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
325,905 ÷ 272,907 = 1 + 52,998
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
272,907 ÷ 52,998 = 5 + 7,917
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
52,998 ÷ 7,917 = 6 + 5,496
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,917 ÷ 5,496 = 1 + 2,421
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,496 ÷ 2,421 = 2 + 654
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,421 ÷ 654 = 3 + 459
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
654 ÷ 459 = 1 + 195
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
459 ÷ 195 = 2 + 69
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
195 ÷ 69 = 2 + 57
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
69 ÷ 57 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
57 ÷ 12 = 4 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 9 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
9 ÷ 3 = 3 + 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,837; 199,999,999,905) = 3
The two numbers have common prime factors