  In this paper, we show that there are only finitely many Narayana's numbers
which can be written as product of three repdigits in base $g$ with $g \geq 2$.
Moreover, for $2 \leq g \leq 10$, we determine all these numbers.
