I know this is an old post, but here is another, more combinatorial and group-theoretic, way to answer such questions.
The group $\mathrm{GL}_3(\Bbb{Z}_3)$ acts on itself by conjugation, and an orbit of this action is the same thing as a conjugacy class. The Orbit-Stabilizer Theorem from group theory says that the size of an orbit is equal to the index of the stabilizer subgroup. That is, for an element $x$ in a set $X$ on which a group $G$ acts, if $\mathcal{O}(x)$ is its orbit and $G_x$ is the stabilizer of $x$, then $\left| \mathcal{O}(x) \right| = \frac{|G|}{|G_x|}$.
In this instance, the stabilizer is the same thing as the centralizer; i.e. the set of matrices which commute with the given one. So the answer to your question is equal to the size of $\mathrm{GL}_3(\Bbb{Z}_3)$ (which you have pointed out is 11,232) divided by the number of matrices which commute with the given diagonal matrix.
Let a given $3 \times 3$ matrix be denoted by
$$ \begin{pmatrix} a & b & c \\ x & y & z \\ p & q & r \end{pmatrix} $$
Writing down the conditions for this matrix to commute with the diagonal matrix with entries $2,2,1$ is equivalent to saying that $c=z=p=q=0$. In other words, the matrices which commute with the diagonal one are the invertible matrices of the form
$$ \begin{pmatrix} a&b&0 \\ x&y&0 \\ 0&0&r \end{pmatrix} $$
For this to be invertible, we must have $r \neq 0$ (so $r=1$ or $r=2$), and the $2 \times 2$ block $\begin{pmatrix}a&b\\c&d\end{pmatrix}$ must be invertible. One quickly sees that there are 96 such matrices.
So the final answer is $\frac{11232}{96} = 117$.