I came across this while doing extra research and I can't seem to get the answer... help me please

Qu: Find as a sum of powers of 10, an odd, positive integer n, such that when ab is multiplied by n, the resulting number has 2k digits and the sum of its digits is divisible by k (where k is a positive integer)