Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,131; 200,000,001,025) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,131 = 3 × 72 × 11 × 61,843
100,000,131 is not a prime number but a composite one.
200,000,001,025 = 52 × 11 × 53 × 2,029 × 6,763
200,000,001,025 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,025 ÷ 100,000,131 = 1,999 + 99,739,156
Step 2. Divide the smaller number by the above operation's remainder:
100,000,131 ÷ 99,739,156 = 1 + 260,975
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,739,156 ÷ 260,975 = 382 + 46,706
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
260,975 ÷ 46,706 = 5 + 27,445
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
46,706 ÷ 27,445 = 1 + 19,261
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
27,445 ÷ 19,261 = 1 + 8,184
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
19,261 ÷ 8,184 = 2 + 2,893
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,184 ÷ 2,893 = 2 + 2,398
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,893 ÷ 2,398 = 1 + 495
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,398 ÷ 495 = 4 + 418
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
495 ÷ 418 = 1 + 77
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
418 ÷ 77 = 5 + 33
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
77 ÷ 33 = 2 + 11
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
33 ÷ 11 = 3 + 0
At this step, the remainder is zero, so we stop:
11 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,131; 200,000,001,025) = 11
The two numbers have common prime factors