I've seen this statement in multiple posts (e.g. here and here), but I can't seem to understand it. I can see why
$$\sum_{\alpha<\omega_2}|\alpha|^{\aleph_0}=\aleph_1^{\aleph_0},$$
by noting that every $\alpha<\omega_2$, so $|\alpha|\leq\aleph_1$, meaning
$$\sum_{\alpha<\omega_2}|\alpha|^{\aleph_0}=\max_{\alpha<\omega_2}|\alpha|^{\aleph_0}=\aleph_1^{\aleph_0}.$$
So how does $\aleph_2$ enter the equation?
The sum has $\aleph_2$ terms, each of which is at most $\aleph_1^{\aleph_0}$, so it’s bounded above by $\aleph_2\cdot\aleph_1^{\aleph_0}$. On the other hand, it’s clearly at least $\aleph_2$ and at least $\aleph_1^{\aleph_0}$, so its bounded below by their maximum, which is simply their product.