This is probably an Algebra or Discrete or number theory problem, but Ill help anyway.
I hope you know modular arithmetic if you were assigned this problem
Reduce mod 13 and see if it is 0 mod 13 or not.

(mod 13)

(mod 13)
Now I suggest calculating the orders of these guys mod 13.
^8 2^7 \equiv 2^7 \equiv -2 \equiv 11)
(mod 13)
Similarly

(mod 13)

(mod 13)
^2 \equiv (-1)^2 \equiv 1 )
(mod 13)
^{11}69 \equiv 4 )
(mod 13)
so Finally

(mod 13)
but if it were divisible by 13 it should be 0 mod 13, so it is not divisible.
You need to check these calculations, I did them very quickly, so they may be unreliable, but that should at least give you an idea.