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, I will present the results of several numerical experiments that examine the richness threshold and the deviation from uniformity of these words. I will also discuss the implications that the validity of this conjecture would have for several long-standing open problem, such as the non-existence of the so-called Z-numbers and the "Collatz-inspired" 4/3-problem.