Base | Representation |
---|---|
bin | 1011101101001100100… |
… | …1101010011000111000 |
3 | 201020002202212101221111 |
4 | 2323103021222120320 |
5 | 11243333410133422 |
6 | 232220015050104 |
7 | 20346501321421 |
oct | 2732311523070 |
9 | 636082771844 |
10 | 201111021112 |
11 | 78321a23871 |
12 | 32b87810934 |
13 | 15c7055b411 |
14 | 9a3b88c648 |
15 | 5370c85a77 |
hex | 2ed326a638 |
201111021112 has 128 divisors (see below), whose sum is σ = 397032652800. Its totient is φ = 95431385088.
The previous prime is 201111021109. The next prime is 201111021149. The reversal of 201111021112 is 211120111102.
It is a happy number.
201111021112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2011110211122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201111021092 and 201111021101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 642527068 + ... + 642527380.
It is an arithmetic number, because the mean of its divisors is an integer number (3101817600).
Almost surely, 2201111021112 is an apocalyptic number.
It is an amenable number.
201111021112 is a deficient number, since it is larger than the sum of its proper divisors (195921631688).
201111021112 is a wasteful number, since it uses less digits than its factorization.
201111021112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 765 (or 761 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201111021112 its reverse (211120111102), we get a palindrome (412231132214).
The spelling of 201111021112 in words is "two hundred one billion, one hundred eleven million, twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •