Smallest Narcissistic Number Given a natural numbers n&gt;1, find the smallest narcissistic number of n digit.
A narcissistic number is a number which is the sum of its own digits, each raised to the power of the number of digits.
For example, for n=3 (3 digits) the out put should be 153:
1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153
For n=4 (4 digits) the out put should be 1634:
1^4 + 6^4 + 3^4 + 4^4 = 1 + 1296 + 81 + 256 = 1634
For n=5 (5 digits) the out put should be 54748:
5^5 + 4^5 + 7^5 + 4^5 + 8^5 = 54748
If there is no such numbers, like for example n = 2 or n = 22 output any special output (a negative number, an exception, an error, empty,...).
Winning Criteria
This is code-golf, so shortest answer in bytes by language wins.
OEIS A005188
05AB1E, 16 15 bytes

Very inefficient.
Empty output if there is no solution.

°LʒDSImOQ}ʒgQ}н


Try it online!