Base | Representation |
---|---|
bin | 1011101100110101000… |
… | …0000000011101110111 |
3 | 201012211212120200110210 |
4 | 2323031100000131313 |
5 | 11243133034133421 |
6 | 232202121120503 |
7 | 20344156662606 |
oct | 2731520003567 |
9 | 635755520423 |
10 | 201012021111 |
11 | 78281055690 |
12 | 32b5a629133 |
13 | 15c55ba7b35 |
14 | 9a2c67ba3d |
15 | 536722c576 |
hex | 2ecd400777 |
201012021111 has 16 divisors (see below), whose sum is σ = 298601998848. Its totient is φ = 119233435200.
The previous prime is 201012021109. The next prime is 201012021127. The reversal of 201012021111 is 111120210102.
201012021111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 201012021111 - 21 = 201012021109 is a prime.
It is a super-2 number, since 2×2010120211112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201012021101) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 64799230 + ... + 64802331.
It is an arithmetic number, because the mean of its divisors is an integer number (18662624928).
Almost surely, 2201012021111 is an apocalyptic number.
201012021111 is a deficient number, since it is larger than the sum of its proper divisors (97589977737).
201012021111 is a wasteful number, since it uses less digits than its factorization.
201012021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129601622.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 201012021111 its reverse (111120210102), we get a palindrome (312132231213).
The spelling of 201012021111 in words is "two hundred one billion, twelve million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •