You can approach this way
Total possible $5$ letter words $-$ words containing $0$ '$a$' $-$ words containing exactly $1$ '$a$'
$(26)^5 - (25)^5 -$ $^{5}C_{1}$$ * (25)^4$
(Assuming $26$ distinct letters from $a$ to $z$ are available and repetition is allowed)