Can the sum of odd divisors of an integer exceed n

52 Views Asked by At

I know that the sum of divisors of an integer n can exceed it (abundant numbers) but can this occur when only considering odd divisors of n? Can the sum of all integers j : j|n, 2∤j be greater than n? If not how is it proven, and if so what is an example?