How do you call the operation of counting the number of euclidian division until the denominator is lower than the remainder?

Question

I was looking for the minimum size of a base35 secret_key to be able to generate at least 1,000,000 secret key.

The result is 35*35*35*35 = 1500625

How do you call this operation of counting the number of euclidian division until the denominator is lower than the remainder ?

Answer 1

I don't think there is a special name, but in a formula this boils down to $$\left\lceil\frac{\ln 1000000}{\ln 35}\right\rceil=4.$$