In this thesis, we give an algorithm to detect all perfect repdigits in any base g > 1. As an application, we find all such examples when g € [2,…, 333], extending a calculation from [3]. In particular, we demonstrate that ...