Fun little puzzle I just came up with. Maybe sci will like solving it.
We know that for a prime p, p divides n! if and only if n>=p. What about the converse? Suppose k is a number such that k divides n! only if n>=k. What are all such k's satisfying the condition?
(this is not supposed to be hard)