Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,987; 200,000,000,283) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,987 = 3 × 33,333,329
99,999,987 is not a prime number but a composite one.
200,000,000,283 = 3 × 17 × 53 × 659 × 112,279
200,000,000,283 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,283 ÷ 99,999,987 = 2,000 + 26,283
Step 2. Divide the smaller number by the above operation's remainder:
99,999,987 ÷ 26,283 = 3,804 + 19,455
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
26,283 ÷ 19,455 = 1 + 6,828
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
19,455 ÷ 6,828 = 2 + 5,799
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
6,828 ÷ 5,799 = 1 + 1,029
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,799 ÷ 1,029 = 5 + 654
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,029 ÷ 654 = 1 + 375
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
654 ÷ 375 = 1 + 279
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
375 ÷ 279 = 1 + 96
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
279 ÷ 96 = 2 + 87
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
96 ÷ 87 = 1 + 9
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
87 ÷ 9 = 9 + 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 (99,999,987; 200,000,000,283) = 3
The two numbers have common prime factors