Let $b\geq 2$ be an integer. For any integer $n\geq 0$, we call \textit{reverse} of $n$ in base $b$ the integer obtained by reversing the digits of $n$. The existence of infinitely many prime numbers whose reverse is also prime is an open problem. In this talk, we will present a joint work with Cécile Dartyge and Joël Rivat, in which we show that there are infinitely many primes with an almost prime reverse. More precisely, we show that there exist $\Omega_b\in \mathbb{N}$ explicit and $c_b>0$ such that, for at least $c_b b^{\lambda} \lambda^{-2}$ primes $p \in [b^{\lambda-1},b^{\lambda}[$, the reverse of $p$ has at most $\Omega_b$ prime factors. Our proof is based on sieve methods and on obtaining a result in the spirit of the Bombieri-Vinogradov theorem concerning the distribution in arithmetic progressions of the reverse of prime numbers.