Finding the total number of digits of an integer is a basic exercise given to every beginner of programming. In this article I will discuss the algorithm as well as provide the code utilizing that.
Almost all of us know how to convert a decimal number, i.e. a number represented in base 10, to a binary which is a number in base 2. We also learn the generalization of it, i.e. converting a decimal number to any positive integral base. But the interesting fact is that it is not essential to have the base to be a positive integer, rather base can be negative, fractional and even imaginary. In this article we will only consider positive fractional base and the arithmetic of it.