Existence of non-context free but decidable languages
You could simply consider the language $L = \{a^k | k \text{ is a prime number }\}$.
This is not a context free language, but surely this is decidable by a Turing Machine that checks if the length N of the input is not divisible by any number between 2 and N-1 .