(x)
return reduce(lambda x, y: x * y, expList, 1)
exponents(28) --> 6 because 28 = 2**2 * 7*1:
    total number of divisors of 28: (2+1)*(1+1) = 6
exponents(28) --> 6 because 28 = 2**2 * 7*1:
    total number of divisors of 28: (2+1)*(1+1) = 6
exponents ( 28 ) -- > 6 because 28 = 2 ** 2 * 7 * 1 : total number of divisors of 28 : ( 2 + 1 ) * ( 1 + 1 ) = 6
def divisors(x):
    '''
    exponents(28) --> 6 because 28 = 2**2 * 7*1:
    total number of divisors of 28: (2+1)*(1+1) = 6
    '''
    expList = []
    count = 0
    divisor = 2
    while divisor <= x:
        while x % divisor == 0:
            x = x/divisor
            count += 1
        if count != 0:
            expList.append(count+1)
        divisor += 1
        count = 0
    return reduce(lambda x, y: x * y, expList, 1)
def divisors ( x ) : expList = [ ] count = 0 divisor = 2 while divisor <= x : while x % divisor == 0 : x = x / divisor count += 1 if count != 0 : expList . append ( count + 1 ) divisor += 1 count = 0 return reduce ( lambda x , y : x * y , expList , 1 )