def amicable_numbers_sum(limit):
    def sum_of_divisors(n):
        total = 1
        for i in range(2, int(n**0.5) + 1):
            if n % i == 0:
                total += i
                if i != n // i:
                    total += n // i
        return total

    total = 0
    for n in range(2, limit + 1):
        s = sum_of_divisors(n)
        if s != n and sum_of_divisors(s) == n:
            total += n
    return total