MathGolf, 55 4 bytes
─Σ\∞=─╡Σ= Explanation
─ get divisors (includes the number itself) Σ╡ sum(list) \ discard from swapright topof elementslist (putsremoves inputthe asnumber TOSitself) ∞ Σ pop a, push 2*asum(list) = pop(a, b), push(a==b) Since MathGolf returns divisors rather than proper divisors, the solution is 2 bytes1 byte longer than it would have been in that case.