Let κ be the number of digits of the integer A which is equal to 13 times the sum of its digits. The least possible A is 10κ−1, while the maximal possible sum of the digits is 9κ. Therefore we need to have:
10κ−1≤13⋅9κ=117κ.(1)
For κ≥4, we will prove using induction that: 10κ−1>117κ, that is, relation (1) is not valid. In fact, for κ=4 we have: 104−1=103>117⋅4=468. If 10κ−1>117κ, for the arbitrary κ>4, then we get:
10(κ+1)−1=10κ=10⋅10κ−1>10⋅117κ=117⋅10κ>117⋅(κ+1).
Therefore the number κ must be less or equal to 3.
* We have to reject the case κ=1, since A=α<13α, with 0<α≤9.
* Similarly we reject the case with κ=2, since A=10α+β<13(α+β).
* Let κ=3 and A=αβγ=100α+10β+γ, 0<α≤9, 0≤β,γ≤9.
Then we have:
100α+10β+γ=13⋅(α+β+γ),0<α≤9,0≤β,γ≤9
⇔87α=3β+12γ,0<α≤9,0≤β,γ≤9
⇔29α=β+4γ,0<α≤9,0≤β,γ≤9
Since 0≤β+4γ≤45⇒29α≤45⇒α≤1 (since α=0), and hence:
β+4γ=29⇒β=29−4γ≥0⇒0≤β=29−4γ≤9
⇒−29≤−4γ≤−20⇒5≤γ≤429⇒γ∈{5,6,7}
* For γ=5⇒β=9 and A=195.
* For γ=6⇒β=5 and A=156.
* For γ=7⇒β=1 and A=117.
Therefore, the positive integers which are equal to 13 times the sum of their digits are 117, 156, and 195.