Take b = 2.

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

513928823 is prime. b^((n-1)/513928823)-1 mod n = 45025957920, which is a unit, inverse 45748318180.

(513928823) divides n-1.

(513928823)^2 > n.

n is prime by Pocklington's theorem.