Determine the maximum integer $n$ such that for each positive integer $k \le \frac{n}{2}$, there exist two positive divisors of $n$ with a difference of $k$.

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