Primality proof for n = 30406113761:

Take b = 2.

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

208147 is prime.
b^((n-1)/208147)-1 mod n = 18750718583, which is a unit, inverse 1677666708.

(208147) divides n-1.

(208147)^2 > n.

n is prime by Pocklington's theorem.