For a positive integer $n$, let $p(n)$ denote the smallest prime divisor of $n$. Find the maximum number of divisors $m$ can have if $p(m)^4 > m$.

Let's think step by step and output the final answer within \boxed{}.
user