Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,136; 200,000,001,306) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,136 = 23 × 23 × 137 × 3,967
100,000,136 is not a prime number but a composite one.
200,000,001,306 = 2 × 3 × 7 × 61 × 431 × 181,123
200,000,001,306 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,306 ÷ 100,000,136 = 1,999 + 99,729,442
Step 2. Divide the smaller number by the above operation's remainder:
100,000,136 ÷ 99,729,442 = 1 + 270,694
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,729,442 ÷ 270,694 = 368 + 114,050
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
270,694 ÷ 114,050 = 2 + 42,594
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
114,050 ÷ 42,594 = 2 + 28,862
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
42,594 ÷ 28,862 = 1 + 13,732
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
28,862 ÷ 13,732 = 2 + 1,398
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
13,732 ÷ 1,398 = 9 + 1,150
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,398 ÷ 1,150 = 1 + 248
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,150 ÷ 248 = 4 + 158
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
248 ÷ 158 = 1 + 90
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
158 ÷ 90 = 1 + 68
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
90 ÷ 68 = 1 + 22
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
68 ÷ 22 = 3 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
22 ÷ 2 = 11 + 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,136; 200,000,001,306) = 2
The two numbers have common prime factors