Primality proof for n = 115446396125903:

Take b = 2.

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

899437463 is prime.
b^((n-1)/899437463)-1 mod n = 43802274537514, which is a unit, inverse 42963445446843.

(899437463) divides n-1.

(899437463)^2 > n.

n is prime by Pocklington's theorem.