Seol mar théacs é seo: Packing, counting and covering Hamilton cycles in random directed graphs