algorithms - Can all real numbers be presented via a natural number and a sequence in the following way?

Is there (for each fixed base system with digits $0,1,\dots,m$) and then for each real number $r\in\mathbb R$, an integer $n\in\mathbb Z$ and a sequence $(a_i)_{i\in\mathbb{N}}$ with $a_i\in\{0,1,\dots,m\}$, such that

$$r=n\cdot 0.a_1a_2a_3\dots$$

and $|n|$ is minimal among all such representations? How to compute it (up to arbitrary precision)?

Intuitively I'd say the answer is yes (apart from maybe pathologies involving signs, zero or one, which I forget) but I'm not acquainted with methods to properly show this. The question came up when thinking about definable and computable real numbers and what it really means to work with non-compact manifolds on a computer or even on paper.