$N$ is a natural number formed by writing, in the ascending order, the first $1002$ whole numbers one after the another. Find the remainder when $N$ is divided by $9$
It is known that if the summation of digits of $N$ is divisible by $9$, then $N$ is. Otherwise, summation when done recursively until it can be divided by $9$ easily, remainder then obtained will be the remainder when $N$ is divided by $9$. I can't figure out how to find summation of the digits of the number $N$.