if such counter example to Lehmer's totient problem exists then could we have more counter examples?

Question

Lehmer's totient problem asks whether there is any composite number $n$ such that Euler's totient function $φ(n)$ divides $n − 1$. which it is unsolved problem or we may reformulate that question as : if $φ(n)$ divides $n − 1$ then $n$ must be a prime , Now my question here is : Assume a such counter example of that problem exists could we have more counter examples for it ?