Sum of the standard deviation of the divisors of a number Let $\sigma_{n}$ be the standard deviation of the divisors of $n$. What is know about the growth rate of the sum $\sum_{n \le x} \sigma_n$? My heuristic analysis  suggest that 
$$
\sum_{n \le x} \sigma_n \sim ax^2
$$
for some constant $a$.
 A: The growth rate is slightly smaller than that. Let's use the notation
$$
\tau(n) = \sum_{d\mid n} 1, \qquad
\sigma(n) = \sum_{d\mid n} d, \qquad
\rho(n) = \sum_{d\mid n} d^2.
$$
Then we want to understand
$$
S(x) = \sum_{n\le x} \sqrt{\frac{\rho(n)}{\tau(n)} - \frac{\sigma(n)^2}{\tau(n)^2} }.
$$
Since $\sqrt{y-z} = \sqrt{y(1-\frac zy)} = \sqrt y(1+O(\frac zy)) = \sqrt y+O(\frac z{\sqrt y})$ for $0\le x\le y$, this becomes
$$
S(x) = \sum_{n\le x} \sqrt{\frac{\rho(n)}{\tau(n)}} + O\bigg( \sum_{n\le x} \frac{\sigma(n)^2}{\rho(n)^{1/2}\tau(n)^{3/2}} \bigg).
$$
In the first sum, the function $\sqrt{\frac{\rho(n)}{\tau(n)}}$ is $n$ times a multiplicative function whose value on primes $p$ is $\sqrt{\frac{1-p^{-2}}2} \sim \frac1{\sqrt2}$. Those familiar with growth rates of multiplicative functions will then heuristically expect that
$$
\sum_{n\le x} \sqrt{\frac{\rho(n)}{\tau(n)}} \sim Cx^2(\log x)^{1/\sqrt2-1}
$$
for some constant $C$. Similarly, $\frac{\sigma(n)^2}{\rho(n)^{1/2}\tau(n)^{3/2}}$ is $n$ times a multiplicative function whose value on primes $p$ is $\frac{(1+1/p)^2}{\sqrt{1+p^{-2}}2^{3/2}} \sim \frac1{2^{3/2}}$, and thus heuristically
$$
\sum_{n\le x} \frac{\sigma(n)^2}{\rho(n)^{1/2}\tau(n)^{3/2}} \sim Dx^2(\log x)^{1/2^{3/2}-1}
$$
for some constant $D$; and this is a smaller order of magnitude than the main term just evaluated. Consequently, we expect that
$$
S(x) \sim Cx^2(\log x)^{1/\sqrt2-1}.
$$
In this case, I believe all the details could be worked out with the Selberg–Delange method, for example.
(If one simply wants to disprove $S(x) \sim ax^2$, one can note that $\sigma_n < \frac{\rho(n)}{\tau(n)}$, that $\rho(n) < n^2 \prod_p ( 1-\frac1{p^2} )^{-1} = \frac{\pi^2n^2}6$ for all $n$, and that $\tau(n) > (\log n)^{\log 2-\epsilon}$ for almost all integers $n$; this last fact is non-obvious but follows from the Hardy–Ramanujan bounds for $\omega(n)$, the number of distinct primes diving $n$.)
