PUMaC 2019 Number Theory A Problem 4

For a positive integer n, let f(n) = \sum_{i=1}^{n} \lfloor \log_2 i \rfloor. We want to find the largest n < 2018 such that n |f(n).