Puzzle: 
Hide: 
Last week at work, my coworker showed me a strange “counting” trick he swore would make a great puzzle. I asked him to demonstrate, and he began: 1, 2, 3, 4, 5 - at which point I cut him off, saying it sounded perfectly normal. He shot me an annoyed look, restarted, and went: 1, 2, 3, 4, 5, 10, 11, 12, 13, 14, 15, 20, 21, 22, 23, 24, 25, 100.
Now he had my attention. He explained it was a way to encode a number, although non-uniquely, by using different bases for each place value. In his example, the secret number was 25, so the ones place was in base 6, and the tens place was in base 3 (n-1 to each).
I agreed, it would make a good puzzle. After some tinkering, I found a way to adapt his idea for you. For any 10 digit string (this includes leading zeros) that is encoded this way, adding 1 to it will always make it equal to 10 billion. Your task is to find the 161,664th instance that 10 billion will be equal to 229,376. Good luck!
You can validate your puzzle solution with
certitude.