Khutoretskii's theorem for generalized computable families

We give sufficient conditions for generalized computable numberings to satisfy the statement of Khutoretskii's theorem. This implies limitedness of universal $\Sigma^0_\alpha$-computable numberings for $2\leqslant\alpha< \omega^{CK}_1$.