In this paper, the authors consider a generalization of the classical Nagell-Ljunggren equation \[ y^q=\frac{b^n-1}{b-1}, \] which concerns the problem of finding perfect powers that are “repunits” in base-\(b\). They classify when it is possible to have infinitely many perfect powers that have a base-\(b\) representation comprised of the concatenation of multiple copies of a fixed word. To be precise, they consider the Diophantine equation \[ y^q=c \frac{b^{n\ell}-1}{b^\ell-1}, \] where \(c\) is an integer with \(b^{\ell-1} \leq c < b^\ell\), and we have \(q, n \geq 2\). If we call a triple \((q,n,\ell)\) admissible if either \((q,n)=(2,2)\), \((n,\ell)=(2,1)\), or \[ (q,n,\ell) \in \{ (2,3,1), (2,3,2), (3,2,2), (3,2,3), (3,3,1), (2,4,1), (4,2,2) \}, \] then the authors’ main result is that there are at most finitely many solutions to the general equation with triples \((q,n,\ell)\) that are not admissible, under the assumption of the \(ABC\)-Conjecture of Masser and Oesterlé. In the case of admissible triples, they explicitly construct infinitely many corresponding solutions. These constructions for admissible triples all essentially come from finding infinitely many integers of certain given fixed norms in real quadratic fields.