Programmers 약수의 합

def solution(n):
    answer = 0

    for i in range(1, n // 2 + 1):
        if (n % i == 0):
            answer += i

    return answer + n

def sumDivisor(num):
    return num + sum([i for i in range(1, (num // 2) + 1) if num % i == 0])