If I have a field of all real numbers on $[0,p) (\mod p)$ under normal addition and multiplication where $p$ is a prime number, it can be shown that all integers have multiplicative inverses that are also integers. This means all rational numbers have integer equivalents E.g. $$ 3\times2 ≡ 1\mod5$$ Therefore $2$ is the multiplicative inverse of $3$ in $\mod 5$. This means that $\frac13 ≡ 2 \mod 5$. I then tried to extend this logic to irrational numbers.
As an example, I took $\pi$. We can represent $\pi$ by the infinite series $$\frac{3}{1}+\frac{1}{10}+\frac{4}{100}+\frac{1}{1000}...$$ Clearly this representation would not work for $\mod 5$ because one would be dividing by $0$. However, in $\mod 3$ and in $\mod 9$, this fraction can be reduced to $$\frac{3}{1}+\frac{1}{1}+\frac{4}{1}+\frac{1}{1}... = 3+1+4+1...$$ This is where I am stuck. Because we are summing an infinite list of integers, it would seem the sum should be an integer. However, as the series gets longer and longer it clearly just cycles through all of the integers and never approaches a definitive answer. So is $\pi$ equivalent to all the integers at once, or do irrational numbers not have integral equivalents in modular arithmetic? Does my logic have any fatal flaws that may account for my results?