Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,136; 200,000,001,440) = ?
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,440 = 25 × 5 × 3,041 × 411,049
200,000,001,440 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,440 ÷ 100,000,136 = 1,999 + 99,729,576
Step 2. Divide the smaller number by the above operation's remainder:
100,000,136 ÷ 99,729,576 = 1 + 270,560
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,729,576 ÷ 270,560 = 368 + 163,496
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
270,560 ÷ 163,496 = 1 + 107,064
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
163,496 ÷ 107,064 = 1 + 56,432
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
107,064 ÷ 56,432 = 1 + 50,632
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
56,432 ÷ 50,632 = 1 + 5,800
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
50,632 ÷ 5,800 = 8 + 4,232
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,800 ÷ 4,232 = 1 + 1,568
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4,232 ÷ 1,568 = 2 + 1,096
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,568 ÷ 1,096 = 1 + 472
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
1,096 ÷ 472 = 2 + 152
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
472 ÷ 152 = 3 + 16
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
152 ÷ 16 = 9 + 8
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
16 ÷ 8 = 2 + 0
At this step, the remainder is zero, so we stop:
8 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,440) = 8 = 23
The two numbers have common prime factors