I think it fits the rng period to fit max 32 bit (4 bil). Somebody in the comments said similar so I feel good about this.
let state = 6, iters = 0;
do {
state = (state * 9301 + 49297) % 233280;
iters++;
} while(state !== 6);
console.log("period is", iters, "iters");
//period is 233280 iters
If you instead took modulo 2^32, I believe the period would indeed be the maximal period, according to this article: https://en.wikipedia.org/wiki/Linear_congruential_generator#...Except they can't: any seed in the range 230888 thru 233279 will produce a signed integer overflow when multiplied by 9301 (eg 9301*230888 = 0x80001608).