Sum-Product numbers

[Eric W. Weisstein]

OEIS

http://www.research.att.com/~njas/sequences/A114457

gives the smallest k such that abs(S(k)P(k)-k) equals n, where S(k) is the 
sum and P(k) is the product of decimal digits of k.

a(n) is small for 0<=n<=99, except for n=33 and 69. Brute-force searching 
for a(33) shows that, if it exists, it must be > 10^11.  Does anyone have 
any ideas on how to find its value?  (Or even show it exists?)

Cheers,
-Eric