Pseudorandom Algorithm for VERY Large (10^634) Numbers?

I'm relatively new to Stack Overflow, so if I posted this question in the wrong place / manner, let me know, and I can correct it. In short, I'm looking for a pseudo-random number generator (an algorithm where you input a seed number and it outputs a different 'random-looking' number, and the same seed will always generate the same output) for numbers between 1 and 95^1,312,000. It sounds daunting, and maybe it's impossible, so below (in hidden text) I've explained what I need this generator for, in case there's an alternative solution. I would use the Linear Feedback Shift Register (LFSR) PRNG, but if I did, I would have to convert the seed number (which could be up to 634 digits long in base-10) into a binary number, which would be so massive that I think it would take too long to compute. In response to a similar question, the Feistel cipher was recommended, but I didn't understand the vocabulary of the wiki page for that method (I'm going into 10th grade so I don't have a degree in encryption), so if you could use layman's terms, I would strongly appreciate it. I'm planning to use python if that is relevant.

Sorry for the very long-winded explanation. Any help is appreciated.