Are all Recursively Enumerable languages which are not Recursive also Undecidable?


Knowing that all Recursive languanges are Decidable and All Not R.E. Languages are Undecidable (correct me if I am wrong), Are all languages which are R.E. but not Recursive also Undecidable?

R.E. ==> Recursively Enumerable