My short advertisement is that it has proven very useful to study Diophantine equations by reducing mod n. The Chinese remainder theorem [1] tells you to focus on reducing mod p^r, where p is a prime. If r = 1 then you are working in a field but in the ring Z/4, for example, I know 2 ≠ 0 and yet 2·2 = 0.
To make the p-adics Z_p I stitch all of these Z/p^r together: an element is a choice of a_r in each Z/p^r and these have to be compatible: a_2 reduces mod p to a_1 and so on. The resulting Z_p has no "zero divisors", and if I allow myself to invert p I get a field Q_p.
This is a huge improvement, a foundation on which to build analysis and geometry as we did over R.