Solution:
The answer is 99.
Let x=dn−1…d2d1d0, i.e. x=10n−1dn−1+⋯+102d2+10d1+d0. Then y=f(x)=10n−1d0+10n−2d1+⋯+10dn−2+dn−1.
Let us show separately that 9∣x4−y4 and that 11∣x4−y4.
Since 10≡1(mod9), x≡y≡dn−1+dn−2+⋯+d1+d0(mod9), so 9∣x−y and therefore also 9∣(x−y)(x3+x2y+xy2+y3)=x4−y4.
Since 10≡−1(mod11), x≡dn−1−dn−2+⋯∓d1±d0(mod11) and y≡d0+d1+⋯∓dn−2±dn−1(mod11), i.e. x≡±y. In either case x4≡y4(mod11), so 11∣x4−y4.
Since 9 and 11 are relatively prime, their product 99 must divide x4−y4.
To see that there is no larger integer that always divides n4−f(n)4, let n=10, so that f(n)=01=1, n4−f(n)4=9999=32⋅11⋅101, and let n=21, so that f(n)=12 and n4−f(n)4=173745=35⋅5⋅11⋅13. The greatest common divisor of these two values of n4−f(n)4 is 32⋅11=99, so there is no larger integer certain to divide n4−f(n)4.