A positive integer $n$ is called \textit{mythical} if every divisor of $n$ is two less than a prime. Find the unique mythical number with the largest number of divisors.

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