EDITED
In case you wanted a non-troll (less troll?) answer, the smallest number divisible by 1-101 that's also greater than zero would be:
7041757898200960193617914702466542659236800
Solution:
I see how my previous answer was incorrect, I just missed a few steps. Not only do we need the product of every prime from 1 to 101, but we need the largest power of each prime that is itself less than 101. This is because every number less than 101 can be factored as a combination of prime numbers, but also, any factor of a number n is necessarily less than n.
So not only do we need...
2*3*5*7*11*13*17*19*23*29*31*37*41*43*47*53*59*61*67*71*73*79*83*89*97*101
We'll also need to include:
The largest power of 2 that is less than 101 (64 = 2^6)
The largest power of 3 that is less than 101 (81 = 3^4)
The largest power of 5 that is less than 101 (25 = 5^2)
And the largest power of 7 that is less than 101 (49 = 7^2).
The smallest power of 11, the next prime number, is 121, which is too large. Thus, our final product becomes:
2*2*2*2*2*3*3*3*3*5*5*7*7*11*13*17*19*23*29*31*37*41*43*47*53*59*61*67*71*73*79*83*89*97*101
= 7041757898200960193617914702466542659236800
Indeed, another answer using Ruby seems to have given the same result. This, above, is the mathematical proof of that.