Base | Representation |
---|---|
bin | 1011101101010011100… |
… | …0010010001100101011 |
3 | 201020011210102200221210 |
4 | 2323110320102030223 |
5 | 11243413321120021 |
6 | 232222532404203 |
7 | 20350302650340 |
oct | 2732470221453 |
9 | 636153380853 |
10 | 201140020011 |
11 | 783373300a7 |
12 | 32b95476663 |
13 | 15c76572828 |
14 | 9a4167a7c7 |
15 | 53735b2e76 |
hex | 2ed4e1232b |
201140020011 has 64 divisors (see below), whose sum is σ = 336505466880. Its totient is φ = 104201287680.
The previous prime is 201140019991. The next prime is 201140020021. The reversal of 201140020011 is 110020041102.
It is a happy number.
201140020011 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 201140020011 - 29 = 201140019499 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201140020021) 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 63 ways as a sum of consecutive naturals, for example, 4439605 + ... + 4484681.
It is an arithmetic number, because the mean of its divisors is an integer number (5257897920).
Almost surely, 2201140020011 is an apocalyptic number.
201140020011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
201140020011 is a deficient number, since it is larger than the sum of its proper divisors (135365446869).
201140020011 is a wasteful number, since it uses less digits than its factorization.
201140020011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45564.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 201140020011 its reverse (110020041102), we get a palindrome (311160061113).
The spelling of 201140020011 in words is "two hundred one billion, one hundred forty million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •