I'm not sure whether I'm taking too seriously something intended as a joke, but this in fact can conceivably be useful! When studying mathematical problems, sometimes you have a number that has some special meaning in your problem (e.g., the first value for which some phenomenon does not occur), you may be able to compute this number by brute-force or by ad-hoc reasoning, and if the number is high enough then someone else finding this number may mean that they are looking at the same problem as you. Since there's a canonical way to write numbers, but not a canonical way to define problems, then this can be helpful for these people to find each other.
An example of a similar phenomenon here https://a3nm.net/work/research/questions/#words-without-shuf... where someone interested in the sequence "abcacbacabc" is plausibly looking at the longest and lexicographically smallest ternary word without a shuffle square substring. Just searching for "abcacbacabc" on Google yields papers who look at this -- and two people independently coming up with the concept could find each other in this way if they write examples the same way even if they don't use the same words to define the concept.
(A related resource in maths is the OEIS https://oeis.org/ to see whether the integer sequence you came up with has already been studied or has another non-obvious reformulation.)