Find perfect numbers using multiprocessing

find_perfect_numbers_multicpu.py

import multiprocessing

def get_divisors_sum(n):
    divisors_sum = 0
    for i in range(1, int(n / 2) + 1):
        if n % i == 0:
            divisors_sum += i
    return divisors_sum

def parallel_perfect_numbers(numbers):
    with multiprocessing.Pool() as pool:
        results = pool.map(get_divisors_sum, numbers)
    return results

if __name__ == "__main__":
    number_list = []
    numbers = list(range(1, 1000))
    results = parallel_perfect_numbers(numbers)
    for i, j in zip(numbers, results):
        if i == j:
            number_list.append(i)

    print(number_list)