I'm a little confused - why is this attributed to a recent blog post/tweet? The number was part of the original wikipedia page on "Polydivisible number", published in 2003[1]. Am I missing something?
P.S.: Just to clarify - it's an interesting problem. But the wording ("the Vitale property" / "Ben announced") seems to suggest there is something special about this not covered by polydivisible numbers.
You'd expect longer numbers in larger bases. The estimate at Wikipedia (https://en.wikipedia.org/wiki/Polydivisible_number#How_many_...) can be generalized: let F_k(n) be the number of n-digit polydivisible numbers in base k. Then F_k(n) ~ (k-1) * k^(n-1) / n!. This gets bigger as n increases up to n = k, then it gets smaller. If I'm doing the asymptotics right you have F_k(ek) approximately equal to 1 - so in base k the largest polydivisible number should have about ek digits.
The length of the longest polydivisible number in base k is in the OEIS (http://oeis.org/A109783) along with this conjecture.
It isn't. But this is what makes mathematics so full of wonders, literally. You start out with the really simple Peano axioms so that you can do elementary counting and somehow it follows that the largest such number happens to be 25 digits long and this particular number. It's the kind of thing where you revert to a three year old and ask: Why? Why? Why?
this number looks pure beautiful XD
I wonder about the value of polydivisble numbers
written in digits different than 10 XD .
and if there was any further algorithm to be found within it
P.S.: Just to clarify - it's an interesting problem. But the wording ("the Vitale property" / "Ben announced") seems to suggest there is something special about this not covered by polydivisible numbers.
[1] https://en.wikipedia.org/w/index.php?title=Polydivisible_num...