This is much simpler than it seems. The divisibility rule for $7$ for $n$-digit number says that when the number is split into blocks of $3$ and an alternating sum formed from right to left, if the result is divisible by $7$ then so is the original number. For this problem, that means that $zyx-xyz$ must be divisible by $7$. $zyx = 100z+10y+x$ and $xyz=100x+10y+z$, so $zyx-xyz = 100z+10y+x-100x-10y-z=99z-99x=99(z-x)$.
$99$ is congruent to $1$ modulo $7$, so the only way $99(z-x)$ will be divisible by $7$ is if $z-x\equiv0\mod(7)$, keeping in mind that $z$ and $x$ are single digit numbers themselves. Obviously, the first set of solutions have $z=x$, and there are $9$ options: $z=x=1, z=x=2, z=x=3$, and so on. In addition, we have $z=9, x=2$ and $z=8, x=1$ and due to the symmetry of the congruence, $z=2, x=9$ and $z=1, x=8$ as well, for a running total of $9+4=13$. Finally, we have $z=0, x=7$ for a total of $14$.
Now to wrap it up: note that the only digit to be determined is $y$, and that it must be a single-digit prime number. There are only $4$ of these: $2,3,5,7$. Any of these can be substituted for $y$ in any of our $14$ possibilities, giving $4\cdot14 = 56$ $6$-digit numbers fulfilling the required format and being divisible by $7$. QED.