An even factor of $G$ is a spanning subgraph $F$ such that every vertex in $F$ has a nonzero even degree. Note that $δ(G)\geq2$ is a trivial necessary condition for a graph to have an even factor, where $δ(G)$ is the minimum degree of $G$. In this paper, for a connected graph $G$ with minimum degree $δ$, we establish a lower bound on the $A_α$-spectral radius of $G$ such that $G$ contains an even factor.