Cantor proved that the cardinality of $\mathbb{R}$ is greater than the cardinality of $\mathbb{N}$. His original argument was not the diagonal argument which you've probably seen.
For a long time after that, these were the only two cardinalities Cantor knew of. He suspected that $|\mathbb{R}|$ was the next greater cardinality after $|\mathbb{N}|$, his famous Continuum Hypothesis (CH). But he didn't even have a proof that there was a next greater cardinality. (Could it be like the rational numbers, where there is no number "right after" 0?)
Eventually, using his theory of ordinal numbers, he proved the existence of the sequence of alephs, $\aleph_0<\aleph_1<\ldots$, with no cardinalities in between. His continuum hypothesis took the form $2^{\aleph_0}=\aleph_1$. (But he didn't write this equation down until decades after he proved that $|\mathbb{R}|>|\mathbb{N}|$. And he never stated the generalized continuum hypothesis, GCH: $2^{\aleph_\alpha}=\aleph_{\alpha+1}$, for any ordinal $\alpha$.)
He was aware of cardinalities greater than all the $\aleph_n$'s with $n\in\mathbb{N}$. The smallest of these is $$\sum_{n\in\mathbb{N}}\aleph_n$$
It's the cardinality of a union of sets $X_n$, where $X_n$ has cardinality $\aleph_n$. It's denoted $\aleph_\omega$. But then of course you have $\aleph_{\omega+1}$, $\aleph_{\omega+2}$, ...
As for reading recommendations: Stillwell's Roads to Infinity is very good. Set Theory: An Open Introduction is free to download, and has more about cardinals. At a more advanced level, there is Frank Drake's Set Theory: An Introduction to Large Cardinals, Keith Devlin's The Joy of Sets, and Lorenz Halbeisen's Combinatorial Set Theory.
Finally, you might want to take a look at my Set Theory Jottings.