OIM 2007 Problem 5

Let's say a positive integer $n$ is atresvido if the set of its divisors (including 1 and $n$ ) can be split in in 3 subsets such that the sum of the elements of each is the same. Determine the least number of divisors an atresvido number can have.