Sum of digits divisible by $27$ I know that every third number is divisible by $3$ and hence, sum of its digits is divisible by $3$. Same holds for $9$ also. But how do we generalise it? We know that the divisibility condition for higher powers of $3$ is not about the sum of digits. How can we find $n$ such that in a group of $n$ consecutive positive integers, there is a number such that the sum of its digits is divisible by $27$ (or $81,$ say)? Does it exist? Please prove or disprove.
 A: New answer instead of editing the - already accepted - answer because the argument is significantly different (and much simpler).

Let $Q(x)$ denote the digit sum of $x$.

Let $r\ge 1$. Then $n=10^r-1=\underbrace{99\ldots 9}_r$  is the smallest $n$ such that among any $n$ consecutive positive integers, at least one has digit sum a multiple of $9r$.

That no smaller $n$ works, is immediately clear because in $1,2,3,\ldots, 10^r-2$, all digit sums are $>0$ and $<9r$. 
Remains to show that in any sequence of $n$ consecutive integers, a digit sum divisible by $9r$ occurs.
This is well-known for $r=1$. For $r>1$, consider $n$ consecutive positive integers
$$a,a+1,\ldots, a+n. $$
Among the first $9\cdot 10^{r-1}=n-(10^{r-1}-1)$ terms, one is a multiple of $9\cdot  10^{r-1}$. Say, $9\cdot 10^{r-1}\mid a+k=:b$ with $0\le k<9\cdot 10^{r-1}$. Then $Q(b)$ is a multiple of $9$, and as the lower $r-1$ digits of $b$ are zero, we have $Q(b+i)=Q(b)+Q(i)$ for $0\le i<10^{r-1}$ and hence 
$$Q( b+10^j-1)=Q(b)+9j,\qquad 0\le j\le r-1.$$ (Note that $k+10^{r-1}-1<10^r-1$, so these terms are really all in our given sequence). It follows that $9r$ divides one of these $Q(b+10^j-1)$.
A: Note that the natural numbers $\{1,2,\cdots, 999\}$ contain integers for which the sum of the digits is any specified value $\pmod {27}$
Considering the multiples of $1000$ we see that each block of $1000$ integers contains one which ends in three $0's$.  
Starting from any integer $k$, we go to the next multiple of $1000$ (a gap of at most $999$).  We then add whatever three (or fewer) digit integer we need to "correct" the sum of the digits $\pmod {27}$, which takes, at most, another $999$.
Thus, every block of $2\times 999$ consecutive integers contains at least one for which the sum of the digits is a multiple of $27$.  A similar argument works for any desired divisor.
I expect the bound could be tightened considerably, but at least this shows that a bound exists.
