  We define $\overline{\psi}$ to be the multiplicative arithemtic function that
satisfies \[\overline{\psi}(p^{\alpha})=\begin{cases} p^{\alpha-1}(p+1), &
\mbox{if } p\neq 2; \\ p^{\alpha-1}, & \mbox{if } p=2 \end{cases}\] for all
primes $p$ and positive integers $\alpha$. Let $\lambda(n)$ be the number of
iterations of the function $\overline{\psi}$ needed for $n$ to reach $2$. It
follows from a theorem due to White that $\lambda$ is additive. Following
Shapiro's work on the iterated $\varphi$ function, we determine bounds for
$\lambda$. We also use the function $\lambda$ to partition the set of positive
integers into three sets $S_1,S_2,S_3$ and determine some properties of these
sets.
