Product of exponents of prime factorization

Let $p(n)$ be the product of the exponents of the prime factorization of $n$. For example, $$p(5184) = p(2^6 3^4) = 24 \;,$$ $$p(65536) = p(2^{16}) = 16 \;.$$ Define $P(n)$ as the number of iterations of $p(\;)$ to reduce $n$ to $1$. For example, $P(5184) = 3$ because $$p(5184)=24, \;p(24) = p(2^3 3^1) = 3, \;p(3)=1 \;;$$ and $P(65536)=4$ because $$p(65536) = 16, \;p(16)=p(2^4)=4, \;p(4)=p(2^2)=2, \; p(2)=1 \;.$$ Finally, define $m(k)$ to be the minimum value of $n$ such that $P(n) = k$.

What is $m(k)$?

For example, $m(1)=2$ and $m(2)=4$ and $m(3)=16$. Is $m(k)$ always $2$ to some power?

Update. Calvin Lin showed that $m(4)$ is not a power of $2$, and is at most $2^4 3^4$. Indeed I have verified (by search) that $m(4)=1296$.

No. Consider $m(4)$. If it was a power of 2, then it must be at least $2^{16}$. (Since if it's of the form $2^n$, then $ n$ needs 3 iterations, and so $ n \geq m(3) = 16$.)

But $p( 2^4 3^4) = 16$, so $m(k) \leq 2^4 \times 3^4 < 2^{16}$.