That is, if the probability of success is 1/450, so failing means 449/450, then if we try it 450 times, then the chance of failing (not succeeding even one time) is:
$$ (449/450) ^ {450} = 0.367470307338961$$
and it can be approximated by
$$ e^{-1} = 0.367879441171442 $$
and if we try 900 times, it is:
$$ (449/450) ^ {900} = 0.13503442677579 $$
and since $ 900 $ is $ 450 \times 2 $, so we approximate using:
$$ e^{-2} = 0.135335283236613 $$
And it doesn't have to be $ 450 $. It can be $ 200, 700, 800, $ or $ 1200 $.
Is there a name of this theorem? And perhaps its origin of how it got found out?
This is already expressed in J. W. Tanner's comment.
By Taylor's theorem, $e^x = 1 + x + O(x^2)$. Therefore, for a fixed integer $k$, $$ \lim_n \left(1 - k/n \right)^n = \lim_n \left( e^{-k/n} + O((k/n)^2) \right)^{n} = e^{-k} + \lim_n \sum_{j = 1}^n O((k/n)^{2j}) e^{-(n-j)k/n} = e^{-k}. $$ Moreover, since $1 - k/n = (n - k)/n$, we can interpret $(1 - k/n)^n$ as the probability of not succeeding even once in an experiment with $n$ trials and success probability $k/n$.
The above suggests that when $n$ is large, $$\left(1 - k/n\right)^n \approx e^{-k}.$$
In your example, $k=1$, but you can take $k=2$ or $k=3$ (etc.) to arrive at $e^{-2}$ or $e^{-3}$.