Three reversed primes in base 10

Work in base $b=10$, and write $\overleftarrow{p}$ for the digit reversal of a prime $p$. Base-10 ternary reversed-prime conjecture. Every sufficiently large odd integer $N$ can be expressed as

$$N=\overleftarrow{p_1}+\overleftarrow{p_2}+\overleftarrow{p_3}.$$

The binary reversed-prime representation fails for infinitely many integers in base $10$, including the obstruction at $6\cdot 10^n$. This conjecture is part of the proposed explanation that the reverse Schnirelmann constant in base $10$ should be $4$, with even integers requiring four reversed primes.