Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,771; 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,771 = 3 × 33,333,257
99,999,771 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,771 = 2,000 + 458,283
Step 2. Divide the smaller number by the above operation's remainder:
99,999,771 ÷ 458,283 = 218 + 94,077
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
458,283 ÷ 94,077 = 4 + 81,975
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
94,077 ÷ 81,975 = 1 + 12,102
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
81,975 ÷ 12,102 = 6 + 9,363
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
12,102 ÷ 9,363 = 1 + 2,739
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,363 ÷ 2,739 = 3 + 1,146
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,739 ÷ 1,146 = 2 + 447
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,146 ÷ 447 = 2 + 252
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
447 ÷ 252 = 1 + 195
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
252 ÷ 195 = 1 + 57
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
195 ÷ 57 = 3 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
57 ÷ 24 = 2 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 9 = 2 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
9 ÷ 6 = 1 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
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,771; 200,000,000,283) = 3
The two numbers have common prime factors