Every non-negative integer can be written (uniquely) in the form
$$x=a_1+2a_2+6a_3+24a_4+120a_5+\cdots$$
where $0\le a_k\le k$. It's easy to show that
$$\big\lfloor {x\over1}\big\rfloor+\big\lfloor {x\over2}\big\rfloor+\big\lfloor {x\over6}\big\rfloor+\big\lfloor {x\over24}\big\rfloor+\cdots=a_1+3a_2+10a_3+41a_4+206a_5+1237a_6+\cdots$$
where the sequence of coefficients $c_k=1,3,10,41,206,1237,\ldots$ satisfies the recursion $c_k=kc_{k-1}+1$. If $1001$ can be represented by such a sum, we must have $a_k=0$ for $k\ge6$, leaving
$$\begin{align}
a_5&=\big\lfloor{1001\over206}\big\rfloor=4\\ \\
a_4&=\big\lfloor{1001-4\cdot206\over41}\big\rfloor=\big\lfloor{177\over41}\big\rfloor=4\\ \\
a_3&=\big\lfloor{177-4\cdot41\over10}\big\rfloor=\big\lfloor{13\over10}\big\rfloor=1\\ \\
a_2&=\big\lfloor{13-10\cdot1\over3}\big\rfloor=\big\lfloor{3\over3}\big\rfloor=1\\ \\
a_1&=0
\end{align}$$
This gives
$$x=0+2\cdot1+6\cdot1+24\cdot4+120\cdot4=2+6+96+480=584$$
as others have found.
Remark: The restriction $0\le a_k\le k$ makes it clear that not every number $N$ can be written in the form $\big\lfloor {x\over1}\big\rfloor+\big\lfloor {x\over2}\big\rfloor+\big\lfloor {x\over6}\big\rfloor+\big\lfloor {x\over24}\big\rfloor+\cdots$ (with integer $x$). The sequence of numbers that can be so written is A060832 in the OEIS. As it happens, $N=1001$, as we just saw, is such a number, but $N=1000$ is not.