A number theory problem by vishwathiga jayasankar

If the last digit of any number is 0 it must be divisible by 10. Because 6=3*2 and there is no factor of 5, any power of 6 is never divisible by 5 and thus also never by 10 meaning a power of 6 can never end with a digit of 0

$6 \equiv 6^2 \pmod{10} \implies 6^n \equiv 6 \pmod{10}, \quad n \in \mathbb{Z}_+$

Hence, the answer is $\boxed{\text{No}}$ .