# Should it be in Computer Science?

For every positive integer $$n$$, let $$\text{d}(n)$$ be the number of positive divisors of $$n$$. Find the sum of all positive integers $$n$$ such that $$n+\text{d}(n)=(\text{d}(n))^2$$.

I'm looking for brilliant solutions. Solutions using programming are also welcome.

×