Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,227; 200,000,001,039) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,227 = 3 × 263 × 126,743
100,000,227 is not a prime number but a composite one.
200,000,001,039 = 3 × 66,666,667,013
200,000,001,039 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,001,039 ÷ 100,000,227 = 1,999 + 99,547,266
Step 2. Divide the smaller number by the above operation's remainder:
100,000,227 ÷ 99,547,266 = 1 + 452,961
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,547,266 ÷ 452,961 = 219 + 348,807
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
452,961 ÷ 348,807 = 1 + 104,154
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
348,807 ÷ 104,154 = 3 + 36,345
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
104,154 ÷ 36,345 = 2 + 31,464
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
36,345 ÷ 31,464 = 1 + 4,881
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
31,464 ÷ 4,881 = 6 + 2,178
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,881 ÷ 2,178 = 2 + 525
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,178 ÷ 525 = 4 + 78
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
525 ÷ 78 = 6 + 57
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
78 ÷ 57 = 1 + 21
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
57 ÷ 21 = 2 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
21 ÷ 15 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
15 ÷ 6 = 2 + 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 (100,000,227; 200,000,001,039) = 3
The two numbers have common prime factors