Solution:

Work backwards: $f(z') = z$ for $z' = 10z$ (always) and for $z' = z - 1$ (provided $z - 1$ is not a multiple of $10$ and $z - 1 \ne 1,$ i.e. $z$ does not end in $1$ and $z \ne 2$). So the integers with $d(x) = n$ form column $n$ of a tree rooted at $1:$ the columns begin $\{1\},$ $\{10\},$ $\{9, 100\},$ $\{8, 90, 99, 1000\},$ and every vertex has two children except $2$ and the vertices ending in $1,$ which have only the child $10z.$

Locate those one-child vertices. Since $2 \to 3 \to \cdots \to 10 \to 1,$ the vertex $2$ sits in column $10.$ A vertex ending in $1$ is reached by subtracting $1$ nine times from a vertex ending in $0,$ so such vertices sit $9$ columns after the multiples of $10$ in the tree. Columns $2$ through $10$ double perfectly (no one-child vertices occur that early), so column $j$ has $2^{j-2}$ vertices, of which the multiples of $10$ — the children $10z$ of column $j - 1$ — number $2^{j-3}.$ Hence for $12 \le k \le 19,$ column $k$ contains $2^{k-12}$ vertices ending in $1$ (column $11$ has none, because the multiple of $10$ in column $2$ is $10$ itself, whose descendant $1$ is excluded — that exclusion is exactly the missing child of $2$).

A one-child vertex in column $k$ removes $2^{19-k}$ of the potential $2^{18}$ vertices from column $20.$ Therefore $$m = 2^{18} - 2^{9} - \sum_{k=12}^{19} 2^{k-12} \cdot 2^{19-k} = 2^{18} - 2^9 - 8 \cdot 2^7 = 2^9(2^9 - 1 - 2) = 2^9 \cdot 509.$$ Since $509$ is prime, the sum of the distinct prime factors of $m$ is $2 + 509 = 511.$