Is there any base representation that produces a non-regular language for set S?
You are right in saying that the binary representation of the language is regular because it is defined by the expression $10^*$(regular expression).
You are also right in saying that this does not hold for the ternary representation. 
You can prove the latter in various ways including the "calssic" pumping lemma (quite cumbersome in this case) or using Cobham's Theorem. 

This theorem says that if you have a subset of $\mathbb{N}$ and you take $m,n \in \mathbb{N} $ such that they are multiplicatively independent, then your set is recognizable by finite automata in both $m$-ary and $n$-ary notation if and only if it is ultimately periodic.