Aliquot Cycles of Repdigits

Abstract. Here we show that the only aliquot cycle consisting only of rep-digits in base 10 is the cycle consisting of the perfect number 6. Generally, we show that if g$g$ is an even positive integer, then there are only finitely many aliquot cycles consisting entirely of repdigits in base g$g$, which are, at least in principle, effectively computable.