Let n:=1829. First, we choose some k such that n∣10k−1. For instance, any multiple of φ(n) would work since n is coprime to 10. We will show that either T=10k−1 or T=10k−2 has the desired property, which completes the proof since k can be taken to be arbitrarily large.
For this it suffices to show that #{di(10k−1):1⩽i⩽9}⩽2. Indeed, if
#{di(10k−1):1⩽i⩽9}=1
then, since 10k−1 which consists of all nines is a multiple of n, we have
di(10k−2)=di(10k−1) for i∈{1,…,8}, and d9(10k−2)<d9(10k−1)
This means that #{di(10k−2):1⩽i⩽9}=2.
To prove that #{di(10k−1)}⩽2 we need an observation. Let ak−1ak−2…a0∈{1,…,10k−1} be the decimal expansion of an arbitrary number, possibly with leading zeroes. Then ak−1ak−2…a0 is divisible by n if and only if ak−2…a0ak−1 is divisible by n. Indeed, this follows from the fact that
10⋅ak−1ak−2…a0−ak−2…a0ak−1=(10k−1)⋅ak−1
is divisible by n.
This observation shows that the set of multiples of n between 1 and 10k−1 is invariant under simultaneous cyclic permutation of digits when numbers are written with leading zeroes. Hence, for each i∈{1,…,9} the number di(10k−1) is k times larger than the number of k digit numbers which start from the digit i and are divisible by n. Since the latter number is either ⌊10k−1/n⌋ or 1+⌊10k−1/n⌋, we conclude that #{di(10k−1)}⩽2.