Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,726; 200,000,000,253) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,726 = 2 × 3 × 16,666,621
99,999,726 is not a prime number but a composite one.
200,000,000,253 = 3 × 617 × 857 × 126,079
200,000,000,253 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,253 ÷ 99,999,726 = 2,000 + 548,253
Step 2. Divide the smaller number by the above operation's remainder:
99,999,726 ÷ 548,253 = 182 + 217,680
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
548,253 ÷ 217,680 = 2 + 112,893
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
217,680 ÷ 112,893 = 1 + 104,787
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
112,893 ÷ 104,787 = 1 + 8,106
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
104,787 ÷ 8,106 = 12 + 7,515
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
8,106 ÷ 7,515 = 1 + 591
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,515 ÷ 591 = 12 + 423
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
591 ÷ 423 = 1 + 168
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
423 ÷ 168 = 2 + 87
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
168 ÷ 87 = 1 + 81
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
87 ÷ 81 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
81 ÷ 6 = 13 + 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 (99,999,726; 200,000,000,253) = 3
The two numbers have common prime factors