In base $15$, Each digit can be any value between $0$ and $14$. So the question becomes,
"how many ways can we split $15$ into four parts (with order counting, so that $(1,2,3,9)$ is considered different from $(9,2,3,1)$ and with none of the parts the whole 15?
Splitting a number into $n$ parts is like taking $n$ balls in a line, and inserting $n-1$ separating walls at $n-1$ points among the line of balls. The trick in this problem is to pretend each ball-or-wall is one "thing"; then there are $15+3 = 18$ things to arrange, and you care where in that line of 18 things the 3 walls appear. This is just 18 choose 3, or
$\binom{18}{3}$.
But in our case, we have to discard the arrangements where all 15 balls are in one partition; there are four such arrangements (corresponding to the improper "numbers"
$(15,0,0,0)$, $(0,15,0,0)$, $(0,0,15,0)$ and $(0,0,0,15)$.
So the answer to your problem is
$$
\binom{18}{3} - 4 = \frac{18\cdot 17 \cdot 16}{3\cdot 2\cdot 1}-4 = 812
$$