Prime numbers with an almost prime reverse

Let $b$ be an integer greater than or equal to $2$. For any integer $n\in [b^{\lambda -1},b^{\lambda }-1]$, we denote by $R_{\lambda }(n)$ the reverse of $n$ in base $b$, obtained by reversing the order of the digits of $n$. We establish a Bombieri-Vinogradov type theorem for the set of the reverses of the prime numbers. Combined with sieve methods, this permits us to prove that there exist ${\mathrm{\Omega }}_b\in \mathbb{N}$ and $c_b>0$ such that, for at least $c_b{b}^{\lambda }{\lambda }^{-2}$ primes $p\in [b^{\lambda -1},b^{\lambda }-1]$, the reverse $R_{\lambda }(p)$ has at most ${\mathrm{\Omega }}_b$ prime factors. Some explicit admissible values of ${\mathrm{\Omega }}_b$ are given.