The most probable order of a random permutation

Given positive integers $n$ and $m$, let $p_n(m)$ be the probability that a uniform random permutation of $[n]$ has order exactly $m$. We show that, as $n\to \mathrm{\infty }$, the maximum of $p_n(m)$ over all $m$ is asymptotic to $1\mathrm{/}n$, the probability of an $n$-cycle. Furthermore, for sufficiently large $n$, we show that the maximum is attained precisely if $m$ is the least positive integer divisible by all positive integers less than or equal to $n-m$. This answers a question of Acan, Burnette, Eberhard, Schmutz and Thomas, originally attributed to work of Erdős and Turán from 1968.