9. Given that $k$ is a positive integer not exceeding 50, such that for any positive integer $n, 2 \times 3^{6 n}+k \times 2^{3 n+1}-1$ is always divisible by 7. Then the number of such positive integers $k$ is $\qquad$.
9.7.
$$
\begin{array}{l}
2 \times 3^{6 n}+k \times 2^{3 n+1}-1 \\
=2 \times 27^{2 n}+2 k \times 8^{n}-1 \\
\equiv 2 \times(-1)^{2 n}+2 k-1 \\
\equiv 2 k+1(\bmod 7) .
\end{array}
$$

But $2 \times 3^{6 n}+k \times 2^{3 n+1}-1 \equiv 0(\bmod 7)$, then
$$
2 k+1 \equiv 0(\bmod 7) \text {, }
$$

which means $2 k+1=7 m$ (where $m$ is an odd number).
Since $1 \leqslant k \leqslant 50$, we have $3 \leqslant 7 m \leqslant 101$.
Thus, $m=1,3, \cdots, 13$, and the corresponding $k=3,10, \cdots, 45$, a total of 7.
