This is a code golf version of a similar question I asked on stack earlier but thought it'd be an interesting puzzle.

Have a 10-length string starting from

Iterate through till you get to

Then start using letters in place to get 36 total iterators

Then push to the next character

And repeat.

The goal of this puzzle is to get the least amount of bytes and create a base-36 iterator, the cycling engine for a loop that is able to convert any string into the next string.

There should be a total of 3,656,158,440,062,976 (3 quadrillions) possible iterations from the base-36 that I have explained here, but I don't expect you to iterate through all of them ;-)

Fake points if you can take the string (e.g. aa820s) and convert it into an integer-version of itself. (e.g. 0000000000 is 1, 0000000010 is 37)