Primality proof for n = 880691887:

Take b = 2.

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

16309109 is prime.
b^((n-1)/16309109)-1 mod n = 81977208, which is a unit, inverse 233990991.

(16309109) divides n-1.

(16309109)^2 > n.

n is prime by Pocklington's theorem.