Funky definitions of prime number

This article lists some definitions of prime number.

Definitions in terms of arithmetic functions

Divisor count function

A natural number $n$ is prime if and only if $\sigma _{0}(n)=2$ where $\sigma _{0}$ is the divisor count function.

Divisor sum function

A natural number $n$ is prime if and only if $\sigma (n)=n+1$, where $\sigma$ is the divisor sum function.

Divisor power sum function

For any $k$, a natural number $n$ is prime if and only if $\sigma (n)=n^{k}+1$, where $\sigma _{k}$ is the $k^{th}$ divisor power sum function.

Euler phi-function

A natural number $n$ is prime if and only if $\varphi (n)=n-1$, where $\varphi$ is the Euler phi-function.

Dedekind psi-function

A natural number $n$ is prime if and only if $\psi (n)=n+1$, where $\psi$ is the Dedekind psi-function.

von Mangoldt function

A natural number $n$ is prime if and only if $n>1$ and $\Lambda (n)=\log n$ where $\Lambda$ is the von Mangoldt function.

In terms of facts true for prime numbers

Wilson's theorem

A natural number $n$ is prime if and only if $n>1$ and $(n-1)!\equiv -1{\pmod {n}}$.

In terms of primality tests

Fill this in later