Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,161; 200,000,001,272) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,161 = 32 × 47 × 236,407
100,000,161 is not a prime number but a composite one.
200,000,001,272 = 23 × 29 × 47 × 18,341,893
200,000,001,272 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,272 ÷ 100,000,161 = 1,999 + 99,679,433
Step 2. Divide the smaller number by the above operation's remainder:
100,000,161 ÷ 99,679,433 = 1 + 320,728
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,679,433 ÷ 320,728 = 310 + 253,753
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
320,728 ÷ 253,753 = 1 + 66,975
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
253,753 ÷ 66,975 = 3 + 52,828
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
66,975 ÷ 52,828 = 1 + 14,147
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
52,828 ÷ 14,147 = 3 + 10,387
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
14,147 ÷ 10,387 = 1 + 3,760
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
10,387 ÷ 3,760 = 2 + 2,867
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,760 ÷ 2,867 = 1 + 893
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,867 ÷ 893 = 3 + 188
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
893 ÷ 188 = 4 + 141
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
188 ÷ 141 = 1 + 47
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
141 ÷ 47 = 3 + 0
At this step, the remainder is zero, so we stop:
47 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,161; 200,000,001,272) = 47
The two numbers have common prime factors