I need to find a prime number $p$ with the following constraints:
- $p$ is at least $1000$ bits long
- $p-1$ is a smooth number with the largest factor below $1000$
- any factor of $p-1$ can be present multiple times
Does this number exist? and if yes, does there is an algorithm to find it?