For each positive integer $n \ge 2$, define $k(n)$ to be the largest integer $m$ such that $(n!)^m$ divides $2016!$. What is the minimum possible value of $n + k(n)$?

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