def divSum(n):
    def sum_of_divisors(num):
        total = 0
        for i in range(1, num + 1):
            if num % i == 0:
                total += i
        return total
    
    digits = [int(d) for d in str(n)]
    
    if len(digits) < 2:
        return False
    
    first_sum = sum_of_divisors(digits[0])
    
    return all(sum_of_divisors(d) == first_sum for d in digits[1:])