Calculus · Easy problem

A puzzle generator can produce $N(x)=x^{x}$ distinct riddles after $x$ rounds of combination, for $x\ge1$. Find the round count $x$ at which the rate of new riddles being produced is exactly DOUBLE the current total, i.e. $N'(x)=2N(x)$.