31932901

Appears in sequences

• a(n) is the smallest number m with n divisors d such that d^m mod m = d.at n=26A371513
• a(n) is the least k that has exactly n proper divisors d such that (-d)^k == -d (mod k).at n=26A380393