Pankaj0901
IanStewartNice! missed the other possibility. How did you think so? Would be great if you could please share your insights on the thought process here. If you know, for example, that the integer n has 100 positive divisors, and you want to imagine what the prime factorization of n might look like, there are lots of possibilities -- it might look like p^4 * q^4 * r * s, say, or like p^49 * q. But the simplest possibility is that the prime factorization looks like p^99. Since we very often want to come up with the simplest possible examples when trying to prove a DS statement is not sufficient, in questions like the one in this thread, the example that occurs to me first is that the number might be 3^15. It then became a question of whether there was a second possible scenario, and there is, 3^3 * p^3.
I'd add though that it's not likely to be important on the actual GMAT to know how to think up simple numbers when you're told "positive integer k has 12 divisors". It seems there's dozens upon dozens of questions on this forum, and in prep company books, about counting divisors. Questions about that do occasionally appear on the GMAT, but they are rare, and they seem to almost never be as complicated as most company questions about the subject.