Use the transition matrix technique. Let $\vec{v}_{k}$ be the vector of 6 components where the nth component probability that you managed to cover $n$ side with $k$ throw at most. Then relate $\vec{v}_{k}$ with $\vec{v}_{k+1}$. What you will find is that $\vec{v}_{k+1}=M\vec{v}_{k}$ where $M$ is the matrix:
Main diagonal: 1/6,2/6,3/6,4/6,5/6,6/6
Below diagonal: 5/6,4/6,3/6,2/6,1/6
(you can work out yourself while it is such matrix).
Now this matrix is diagonalizable, making it very easy to raise to a certain power. You also know the value of $\vec{v}_{1}=(1,0,0,0,0,0)^{t}$. Hence to get the answer simply find the 6th component of $M^{13}\vec{v}_{1}$.
You should get $\frac{45674188560}{6^{14}}$