The rational base number system, introduced by Akiyama, Frougny, and Sakarovitch in 2008, is a generalization of the classical integer base number system. Within this framework two interesting families of infinite words emerge, called minimal and maximal words. We conjecture that every minimal and maximal word is normal over an appropriate subalphabet. To support this conjecture, we present extensive numerical experiments that examine the richness threshold and the deviation from normality of these words. We also discuss the implications that the validity of our conjecture would have for several long-standing open problems, including the existence of $Z$-numbers (Mahler, 1968) and $Z_{p/q}$-numbers (Flatto, 1992), the existence of triple expansions in rational base $p/q$ (Akiyama, 2008), and the Collatz-inspired `4/3 problem' (Dubickas and Mossinghoff, 2009).