Primality proof for n = 35511557:

Take b = 2.

b^(n-1) mod n = 1.

8877889 is prime.
b^((n-1)/8877889)-1 mod n = 15, which is a unit, inverse 16572060.

(8877889) divides n-1.

(8877889)^2 > n.

n is prime by Pocklington's theorem.