We say that a positive integer $n$ is [i]divable [/i] if there exist positive integers $1 < a < b < n$ such that, if the base-$a$ representation of $n$ is $\sum_{i=0}^{k_1} a_ia^i$ , and the base-$b$ representation of $n$ is $\sum_{i=0}^{k_2}  b_ib^i$ , then for all positive integers $c > b$, we have that $\sum_{i=0}^{k_2}  b_ic^i$ divides $\sum_{i=0}^{k_1}  a_ic^i$. Find the number of non-divable $n$ such that $1 \le n \le  100$.

Let's think step by step and output the final answer within \boxed{}.
user