Consider a perfect cube $N^3$ where $N$ is a positive integer. You are given the following cryptic clues related to $N$:
- The sum of the digits of $N$ is a perfect square.
- $N$ is divisible by the sum of its digits.
- The prime factorization of $N$ includes exactly three distinct primes.
Determine the smallest possible value of $N$ that satisfies all these conditions.
$\textbf{My Work:}$
Let $N = abc$ be the three-digit number representing the cube. Without loss of generality, assume $a$, $b$, and $c$ are the digits of $N$.
Despite my efforts in analyzing the conditions and attempting various approaches, I couldn't determine the smallest possible value of $N$ that satisfies all these conditions. Any guidance, insights, or a solution from the community would be greatly appreciated.
$N$ can’t be one-digit. Let us try to find two-digit $N$. The sum of its digits is a square, so $1$, $4$, $9$ or $16$. There is only $10$ with sum $1$, it doesn’t fit.
If the sum if digits of $N$ is $4$, then $N$ is $13$, $22=2\cdot11$, $31$, $40=2^3\cdot5$. Doesn’t work again.
If the sum of digits is $9$, then we have to try $18=2\cdot3^2$, $27=3^3$, $36=2^2\cdot3^2$, $45=5\cdot3^2$, $54=2\cdot3^3$, $63=3^2\cdot7$, $72=2^3\cdot3^2$, $81=3^4$, $90=2\cdot3^2\cdot5$.
If the sum of digits is $16$, then we look at $79$, $88=2^3\cdot11$, $97$.
The sum can’t be greater than $18$.
$90$ is divisible by $9+0=9$, so this is the answer.