Hi, I am new here and have the same problem when trying to solve this kata in Python as wing_clover had.
If the argument num_div is 13, then the first number with 13 divisors is 120: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 120.
It is true that 4096 has 13 divisors (1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096) but it is not the smallest number with 13 divisors.
I also don't understand raulbc777's statement '120 is divisor of 4096' which is obviously not true.

This is not correct solution, because it returns negative values if n is negative