Abstract: One of the fundamental questions in number theory is to find primes in any subset of the natural numbers. In general, it's a difficult question and leads to open problems like the twin prime conjecture, Landau's problem and many more. Recently, Maynard considered the set of natural numbers with a missing digit and showed that it contains infinitely many primes whenever the base b ≥ 10. In fact, he has established the right order of the upper and the lower bounds when the base b = 10 and an asymptotic formula whenever b is large (say 2 ◊ 10⁶). In this talk, we will consider the distribution of primes with a missing digit in arithmetic progressions for base b large enough. In particular, we will show an analog of the Bombieri-Vinogradov type theorems for primes with a missing digit for large base b. The proof relies on the circle method, which in turn is based on the Fourier structure of the digital set and the Fourier transform of primes over arithmetic progressions on an average. Finally, we will give its application to count the primes of the form p = 1 + m≤ + n≤ with a missing digit for a large base.