Abundant Number | Function to calculate sum of divisors ; Note that this loop runs till square root of n ; If divisors are equal , take only one of them ; Otherwise take both ; calculate sum of all proper divisors only ; Function to check Abundant Number ; Return true if sum of divisors is greater than n . ; Driver Code
function getSum ( n ) { let sum = 0 ; for ( let i = 1 ; i <= Math . sqrt ( n ) ; i ++ ) { if ( n % i == 0 ) { if ( n / i == i ) sum = sum + i ; else { sum = sum + i ; sum = sum + ( n / i ) ; } } } sum = sum - n ; return sum ; } function checkAbundant ( n ) { return ( getSum ( n ) > n ) ; } let k = checkAbundant ( 12 ) ? " " : " " ; document . write ( k ) ; k = checkAbundant ( 15 ) ? " " : " " ; document . write ( k ) ;