 Completely additive arithmetic function

A completely additive arithmetic function satisfies $f(mn)=f(m)+f(n)$ for all positive $m,n$, equivalently $f(p^k)=kf(p)$. The total number of prime factors is an example.