Regarding your three questions:

I have no idea what the intuition is behind Ramanujan's formula, but I hope someone else does, since I'd certainly like to know.

Expressing the same number as a series in different ways is generally not useful per se, assuming you don't count being interesting or beautiful as being useful. Replacing a slowly converging series with a rapidly converging one can be useful if you want to compute a numerical approximation. If you get lucky, a new series may lead to a remarkable algorithm (such as the Bailey-Borwein-Plouffe algorithm for computing individual binary digits of $\pi$) or irrationality proof (such as Apery's proof of the irrationality of $\zeta(3)$), but you certainly can't count on that.

As for applications of continued fractions in the real world, I don't know of many applications for continued fraction expansions of real numbers. Of course simple continued fractions are critical if you want good rational approximations, but not very many people do want them in practice.

On the other hand, continued fraction expansions of functions have lots of real-world uses. The intuition is that people are rarely interested in the properties of specific numbers in applied problems, but they are more likely to be interested in specific functions.

For example, the Berlekamp-Massey algorithm efficiently reconstructs a linear recurrence relation from a sequence satisfying it, and it can be reformulated in terms of computing the continued fraction expansion of a rational function. This is "linear feedback shift register synthesis", which comes up in many practical problems; among other things, it's used for decoding Reed-Solomon error-correcting codes, which are used on CDs, DVDs, and Blu-ray discs. It also comes up in some Krylov subspace algorithms for sparse linear algebra, such as the Wiedemann algorithm.

Another practical application is computing in the Jacobian of a hyperelliptic curve $y^2 = f(x)$ over a field $K$ (which may not sound very practical, but it is if you want to do hyperelliptic curve cryptography). This amounts to finding a reduction algorithm for divisors on the curve, and it can be done very efficiently if you know how the continued fractions of functions in $K(x,\sqrt{f(x)})$ behave.

A third case is computing Pade approximants of transcendental functions (this goes slightly beyond continued fractions, but is closely connected). Pade approximants give excellent rational function approximations to a given function, which are much more tractable on a computer than the original function was.