Non Recursively Enumerable Languages
Every undecidable yet semi-decidable language provides an example: its complement.

That is because if $L$ and $\overline{L}$ are both semi-decidable, they are also both decidable -- proving that is an easy exercise.

You should know at least one such language from class.


   The Halting language, and probably numerous others from exercise problems.