<p>Given an integer array <code>nums</code>, return <em>the sum of divisors of the integers in that array that have exactly four divisors</em>. If there is no such integer in the array, return <code>0</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [21,4,7]
<strong>Output:</strong> 32
<strong>Explanation:</strong> 
21 has 4 divisors: 1, 3, 7, 21
4 has 3 divisors: 1, 2, 4
7 has 2 divisors: 1, 7
The answer is the sum of divisors of 21 only.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [21,21]
<strong>Output:</strong> 64
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,4,5]
<strong>Output:</strong> 0
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution:

    def __init__(self):
        self.primes_list = self.getPrimesBelowN(10 ** 5 + 1)
        self.primes_set = set(self.primes_list)

    def getPrimesBelowN(self, n: int) -> list:
        sieve = [1] * n
        sieve[0] = 0
        sieve[1] = 0
        for i in range(math.floor(n ** 0.5) + 1):
            if sieve[i]:
                for j in range(i * i, n, i):
                    sieve[j] = False
        return [i for i in range(n) if sieve[i]]

    def sumFourDivisors(self, nums: List[int]) -> int:

        res = 0
        for x in nums:
            if x == 1 or x in self.primes_set:
                continue
            for p in self.primes_list:
                if x % p:
                    continue
                k = x // p # x = k * p
                if k in self.primes_set and p != k or k == p ** 2:
                    res += 1 + p + (x // p) + x
                    break
        return res        
19000