algorithm or c code implementation to find the smallest postive integer that has n or more divisors
===

What is the efficient way to find the smallest integer with given or more number of divisors?
What i naively think is stat find the number of divisors of numbers starting from 2.
Sure this is not the best way.
Is there a way of guessing the starting point close to the answer.May be some relation between n and the number of divisor it can have.  