(There is my initial question, but by advice of @Charles I'm splitting it)
For integers we have a primality function: $$ isprime(n)=\begin{cases}1,&\text{$n$ is prime}\\0,&\text{$n$ is not prime}\end{cases} $$ (in initial question I used $np(n)=1-isprime(n)$).
My question: can we construct an analytic continuation of primality function and get entire function?
I think that we can, and there is should be smth like $isprime(z)\sim \pi'(z)$ (because $\pi(n)=\sum_{i=1}^n isprime(i)$).
it is an exercise in Ahlfors that one may specify an infinite sequence $a_n$ ( such as the positive integers), with requirement $a_n \rightarrow \infty,$ and the values $A_n$ there, and build an entire function with $f(a_n) = A_n.$ Page 196 in the second edition.
No reason to expect this to have any information, any such function is far from unique, since one may add in some favorite value at, say, $3/2$ or at $i$ and change the thing.