Let's define $\Pi_n(x)$ as the number of prime powers $p^n$ with exponent $n$ that are less than $x$. Clearly $\Pi_1(x) = \Pi(x)$, the usual prime counting function.
Since $p^n < x$ implies that $p < x^{1/n}$, we have
$$
\Pi_n(x) = \Pi\left(x^{1/n}\right)\, .
$$
Your $f(x)$ is:
\begin{align}
f(x) &= \sum_{n=1}^{\infty} \Pi_n(x)\\
&= \sum_{n=1}^{\infty}\Pi\left(x^{1/n}\right)\, .
\end{align}
For fixed $x$, $x^{1/n}$ will eventually go to 1 as $n\rightarrow\infty$, so this sum will actually terminate at some point. (Actually the sum need only go up to the point where $x^{1/n} < 2$, i.e. $n_{max} = \left\lfloor \ln x / \ln 2 \right \rfloor$.)
Beyond that, at present, all I have are numerics (done in Mathematica) which loosely suggest that
$$
\lim_{x\rightarrow\infty} \frac{f(x)}{x} = 0\, ,
$$
although convergence seems to be very, very slow. (Perhaps going as $1/\ln(x)$?)
Edit:
Numerically, it looks like the limit
$$
\lim_{x\rightarrow\infty} \frac{f(x)}{x/\ln(x)}
$$
may exist, and have a value $\ge 1$. (I suspect the actual limit is 1 itself, but the convergence is very slow.)
Edit 2:
For those down-voting this, note that the original questioner asked me (in the comments above) to post the proof of $f(x) = \sum_{n=1}^{\infty}\Pi\left(x^{1/n}\right)$. I'm just trying to be helpful. (Unless I've made an error here, in which case let me know.)