A Poulet-number is a composite positive integer $\ N>1\ $ satisfying the condition $$2^{N-1}\equiv 1\mod N$$ The numbers $$10^{16}+8\ 663\ 854\ 653$$ and $$10^{17}+209\ 045\ 665\ 633$$ are Poulet-numbers.
Are the numbers the smallest Poulet-numbers above $10^{16}$ and $10^{17}$ respectively ?
How can I search the smallest Poulet number above a given number efficiently ?