Base | Representation |
---|---|
bin | 1011101101001100101… |
… | …0000001000010110101 |
3 | 201020002210001010020102 |
4 | 2323103022001002311 |
5 | 11243333421121114 |
6 | 232220021043445 |
7 | 20346502156106 |
oct | 2732312010265 |
9 | 636083033212 |
10 | 201111113909 |
11 | 78321a87562 |
12 | 32b87856585 |
13 | 15c70591724 |
14 | 9a3b8b43ad |
15 | 5370ca32de |
hex | 2ed32810b5 |
201111113909 has 2 divisors, whose sum is σ = 201111113910. Its totient is φ = 201111113908.
The previous prime is 201111113899. The next prime is 201111113953. The reversal of 201111113909 is 909311111102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 189516562225 + 11594551684 = 435335^2 + 107678^2 .
It is a cyclic number.
It is not a de Polignac number, because 201111113909 - 212 = 201111109813 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201111113969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100555556954 + 100555556955.
It is an arithmetic number, because the mean of its divisors is an integer number (100555556955).
Almost surely, 2201111113909 is an apocalyptic number.
It is an amenable number.
201111113909 is a deficient number, since it is larger than the sum of its proper divisors (1).
201111113909 is an equidigital number, since it uses as much as digits as its factorization.
201111113909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 29.
The spelling of 201111113909 in words is "two hundred one billion, one hundred eleven million, one hundred thirteen thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •