We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-Löf random left-computably enumerable reals has a Friedberg numbering, as does the family of all Π 1 classes of positive measure. On the other hand, the Π 1 classes contained in the Martin-Löf random reals do not even have an effective numbering, nor ...