Page "Primitive recursive function" Paragraph 2

Most of the functions normally studied in number theory are primitive recursive.

For example: addition, division, factorial, exponential and the nth prime are all primitive recursive.

So are many approximations to real-valued functions.

In fact, it is difficult to devise a computable function that is not primitive recursive, although some are known ( see the section on Limitations below ).