Primality proof for n = 354936430157:

Take b = 2.

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

13884229 is prime.
b^((n-1)/13884229)-1 mod n = 335217581740, which is a unit, inverse 58292490803.

(13884229) divides n-1.

(13884229)^2 > n.

n is prime by Pocklington's theorem.