Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,161; 200,000,000,895) = ?
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,000,895 = 3 × 5 × 17 × 29 × 83 × 499 × 653
200,000,000,895 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,895 ÷ 100,000,161 = 1,999 + 99,679,056
Step 2. Divide the smaller number by the above operation's remainder:
100,000,161 ÷ 99,679,056 = 1 + 321,105
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,679,056 ÷ 321,105 = 310 + 136,506
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
321,105 ÷ 136,506 = 2 + 48,093
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
136,506 ÷ 48,093 = 2 + 40,320
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
48,093 ÷ 40,320 = 1 + 7,773
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
40,320 ÷ 7,773 = 5 + 1,455
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,773 ÷ 1,455 = 5 + 498
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,455 ÷ 498 = 2 + 459
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
498 ÷ 459 = 1 + 39
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
459 ÷ 39 = 11 + 30
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
39 ÷ 30 = 1 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
30 ÷ 9 = 3 + 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,161; 200,000,000,895) = 3
The two numbers have common prime factors