
    Given the total number of delivery stops in a route segment, calculate the sum of all possible ways this route can be evenly divided (including single stops and the total route) to determine optimal fleet allocation. For example, if there are 12 delivery stops, we need the sum of all numbers that can evenly divide the route (1, 2, 3, 4, 6, and 12) to analyze potential route splitting configurations.
    

    
def sum_div(number):
    """
    Given the total number of delivery stops in a route segment, calculate the sum of all possible ways this route can be evenly divided (including single stops and the total route) to determine optimal fleet allocation. For example, if there are 12 delivery stops, we need the sum of all numbers that can evenly divide the route (1, 2, 3, 4, 6, and 12) to analyze potential route splitting configurations.
    

    """
def sum_div(number):
    """
    Given the total number of delivery stops in a route segment, calculate the sum of all possible ways this route can be evenly divided (including single stops and the total route) to determine optimal fleet allocation. For example, if there are 12 delivery stops, we need the sum of all numbers that can evenly divide the route (1, 2, 3, 4, 6, and 12) to analyze potential route splitting configurations.
    

    """
    divisors = [1]
    for i in range(2, number):
        if number % i == 0:
            divisors.append(i)
    return sum(divisors)