Complexity of natural numbers and arithmetic compact sets

The complexity $\mathrm{\parallel }n\mathrm{\parallel }$ of a natural number is the least number of $1$ needed to represent $n$ using the 5 symbols $(,),\ast ,+,1$. A natural number $n$ is called stable is $\mathrm{\parallel }{3}^{k}n\mathrm{\parallel }=\mathrm{\parallel }n\mathrm{\parallel }+3k$. For each natural number $n$, the number $3^{a}n$ is stable for some $a\ge 0$, and we define the stable complexity of $n$ as $\mathrm{\parallel }n{\mathrm{\parallel }}_{\mathrm{s}\mathrm{t}}=\mathrm{\parallel }{3}^{a}n\mathrm{\parallel }-3a$. We show that the closure of the set of all fractions $n\mathrm{/}{3}^{\lfloor \mathrm{\parallel }n{\mathrm{\parallel }}_{\mathrm{s}\mathrm{t}}\mathrm{/}3\rfloor }$ has remarkable properties; self-similarity $3K^{\mathrm{\prime }\mathrm{\prime }\mathrm{\prime }}=K$, well-ordered, and certain arithmetical properties. We pose the question about the unicity of this compact. This question raises some problems about the complexity of natural numbers that we are unable to answer.