Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,071; 200,000,000,805) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,071 = 32 × 11,111,119
100,000,071 is not a prime number but a composite one.
200,000,000,805 = 3 × 5 × 11 × 1,212,121,217
200,000,000,805 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,805 ÷ 100,000,071 = 1,999 + 99,858,876
Step 2. Divide the smaller number by the above operation's remainder:
100,000,071 ÷ 99,858,876 = 1 + 141,195
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,858,876 ÷ 141,195 = 707 + 34,011
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
141,195 ÷ 34,011 = 4 + 5,151
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
34,011 ÷ 5,151 = 6 + 3,105
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,151 ÷ 3,105 = 1 + 2,046
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,105 ÷ 2,046 = 1 + 1,059
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,046 ÷ 1,059 = 1 + 987
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,059 ÷ 987 = 1 + 72
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
987 ÷ 72 = 13 + 51
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
72 ÷ 51 = 1 + 21
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
51 ÷ 21 = 2 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
21 ÷ 9 = 2 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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 (100,000,071; 200,000,000,805) = 3
The two numbers have common prime factors