Ordinals of the form $\alpha=\omega+\alpha$? Epsilon numbers are the  fixed points of ordinal exponentiation. i.e., $\epsilon=\omega^{\epsilon}.$   But I never came up with any ordinal number of the form $\alpha=\beta+\alpha$ for all ordinals $\omega\le\beta\lt\alpha.$ I tried to prove that there is no such ordinal and couldn't success. Any hint?
 A: Regarding the title question, which is different from the question in the body, the answer is:  
Theorem. An ordinal $\alpha$ has the form $\alpha=\omega+\alpha$ if and only if $\omega^2\leq\alpha$. 
In particular, every ordinal above $\omega^2$ has the property in the title.
Proof. If $\alpha<\omega^2$, then $\alpha=\omega\cdot n+k$ for some finite $n,k<\omega$, and it is easy to see that $\alpha<\omega\cdot(n+1)+k=\omega+\alpha$. 
Conversely, if $\omega^2\leq\alpha$, then $\alpha=\omega^2+\eta$ for some ordinal $\eta$. Since $1+\omega=\omega$, it follows by multiplying by $\omega$ on both sides (on the left) that $\omega+\omega^2=\omega^2$, and from this it follows that $\omega+\alpha=\omega+\omega^2+\eta=\omega^2+\eta=\alpha$, as  desired. $\Box$
More generally, we can provide a similar criterion for any fixed $\beta$. 
Theorem. For any ordinal $\beta$, the ordinals $\alpha$ of the form $\alpha=\beta+\alpha$ are precisely the ordinals with $\beta\cdot\omega\leq\alpha$. 
Proof. If $\alpha<\beta\cdot\omega$, then $\alpha=\beta\cdot n+\gamma$ for some $n<\omega$ and some $\gamma<\beta$. It follows that $\alpha<\beta\cdot (n+1)+\gamma=\beta+\alpha$. 
Conversely, if $\beta\cdot\omega\leq\alpha$, then we may write $\alpha=\beta\cdot\omega+\eta$ for some ordinal $\eta$. Since $1+\omega=\omega$, it follows that $\beta\cdot(1+\omega)=\beta\cdot\omega$ and therefore $\beta+\beta\cdot\omega=\beta\cdot\omega$. Thus, $\beta+\alpha=\beta+\beta\cdot\omega+\eta=\beta\cdot\omega+\eta=\alpha$, as desired. $\Box$
