Friedberg numberings of families of partial computable functionals

We consider computable numberings of families of partial computable functionals of finite types. We show, that if a family of all partial computable functionals of type 0 has a computable Friedberg numbering, then family of all partial computable functionals of any given type also has computable Friedberg numbering. Furthermore, for a type $\sigma|\tau$ there are infinitely many nonequivalent computable minimal nonpositive, positive nondecidable and Friedberg numberings.