Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,212; 200,000,001,242) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,212 = 22 × 3 × 13 × 269 × 2,383
100,000,212 is not a prime number but a composite one.
200,000,001,242 = 2 × 100,000,000,621
200,000,001,242 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,242 ÷ 100,000,212 = 1,999 + 99,577,454
Step 2. Divide the smaller number by the above operation's remainder:
100,000,212 ÷ 99,577,454 = 1 + 422,758
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,577,454 ÷ 422,758 = 235 + 229,324
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
422,758 ÷ 229,324 = 1 + 193,434
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
229,324 ÷ 193,434 = 1 + 35,890
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
193,434 ÷ 35,890 = 5 + 13,984
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
35,890 ÷ 13,984 = 2 + 7,922
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
13,984 ÷ 7,922 = 1 + 6,062
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
7,922 ÷ 6,062 = 1 + 1,860
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
6,062 ÷ 1,860 = 3 + 482
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,860 ÷ 482 = 3 + 414
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
482 ÷ 414 = 1 + 68
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
414 ÷ 68 = 6 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
68 ÷ 6 = 11 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 0
At this step, the remainder is zero, so we stop:
2 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,212; 200,000,001,242) = 2
The two numbers have common prime factors