Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,071; 200,000,000,877) = ?
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,877 = 3 × 137 × 486,618,007
200,000,000,877 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,877 ÷ 100,000,071 = 1,999 + 99,858,948
Step 2. Divide the smaller number by the above operation's remainder:
100,000,071 ÷ 99,858,948 = 1 + 141,123
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,858,948 ÷ 141,123 = 707 + 84,987
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
141,123 ÷ 84,987 = 1 + 56,136
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
84,987 ÷ 56,136 = 1 + 28,851
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
56,136 ÷ 28,851 = 1 + 27,285
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
28,851 ÷ 27,285 = 1 + 1,566
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
27,285 ÷ 1,566 = 17 + 663
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,566 ÷ 663 = 2 + 240
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
663 ÷ 240 = 2 + 183
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
240 ÷ 183 = 1 + 57
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
183 ÷ 57 = 3 + 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 (100,000,071; 200,000,000,877) = 3
The two numbers have common prime factors