Fix a positive integer $p$, possibly prime.
For each natural number $n$, there is a ring $\mathbb{Z}/p^n \mathbb{Z}$ together with a distinguished ring homomorphism $$\pi_n:\mathbb{Z} \rightarrow \mathbb{Z}/p^n \mathbb{Z}.$$ For any given integer $k$, we can think of $\pi_n(k)$ as the remainder when $k$ is divided by $p^n$.
Now clearly, $\pi_n$ will never be injective. If we wanted to get around this, we could trying bundling up all the $\mathbb{Z}/p^n \mathbb{Z}$ together as a direct product. So define:
$$\mathbb{Z}/p^\mathbb{N} \mathbb{Z} = \prod_{n:\mathbb{N}} \mathbb{Z}/p^n\mathbb{Z}$$
There is, of course, a unique ring homomorphism $\pi : \mathbb{Z} \rightarrow \mathbb{Z}/p^\mathbb{N} \mathbb{Z}.$ In fact, it can be computed pointwise: $$(\pi(k))_{n} = \pi_n(k)$$
In some sense, we might say that $\pi(k)$ is the sequence of remainders obtained by attempting to divide $k$ by increasingly large powers of $p$.
The cool thing about this is that:
I'm pretty sure that $\pi$ is always injective; hence, we've included the integers in a bigger number system. Perhaps there are situations where we're working away in $\mathbb{Z}$ but we find that there aren't "enough" integers to do what we're trying to do; if so, one idea would be to look in $\mathbb{Z}/p^\mathbb{N} \mathbb{Z}$ for an appropriate choice of $p.$
Suppose $p$ is a prime number. Then to compute the number of copies of $p$ in the prime factorization of an integer $k$, we can simply count the number of $0$'s in the sequence $\pi(k)$. Furthermore, these $0$'s will always occur as an initial segment.
Question. Is $\mathbb{Z}/p^\mathbb{N} \mathbb{Z}$ widely studied, is it associated with a standard name or notation, and where can I learn more about it?