Problem 1060

Erdős Problem #1060: declared status 'open'. Formalized: yes. Let $f(n)$ count the number of solutions to $k\sigma(k)=n$, where $\sigma(k)$ is the sum of divisors of $k$. Is it true that $f(n)\leq n^{o(\frac{1}{\log\log n})}$? Perhaps even $\leq (\log n)^{O(1)}$? Prize: no. OEIS: A327153. Tags: number theory.