Base | Representation |
---|---|
bin | 1001001001100100110100… |
… | …00001111011011000110001 |
3 | 2122020110210002200120222220 |
4 | 10210302122001323120301 |
5 | 10114122143004323441 |
6 | 110443033005151253 |
7 | 4144431404532024 |
oct | 444623201733061 |
9 | 78213702616886 |
10 | 20120211011121 |
11 | 6457a2a645a11 |
12 | 230b521b5b529 |
13 | b2c43510c250 |
14 | 4d7b756111bb |
15 | 24d58d61d466 |
hex | 124c9a07b631 |
20120211011121 has 32 divisors (see below), whose sum is σ = 29085525100800. Its totient is φ = 12298117703424.
The previous prime is 20120211011101. The next prime is 20120211011129. The reversal of 20120211011121 is 12111011202102.
It is a happy number.
It is not a de Polignac number, because 20120211011121 - 27 = 20120211010993 is a prime.
It is a super-2 number, since 2×201202110111212 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20120211011121.
It is not an unprimeable number, because it can be changed into a prime (20120211011129) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 228810655 + ... + 228898571.
It is an arithmetic number, because the mean of its divisors is an integer number (908922659400).
Almost surely, 220120211011121 is an apocalyptic number.
It is an amenable number.
20120211011121 is a deficient number, since it is larger than the sum of its proper divisors (8965314089679).
20120211011121 is a wasteful number, since it uses less digits than its factorization.
20120211011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127465.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20120211011121 its reverse (12111011202102), we get a palindrome (32231222213223).
The spelling of 20120211011121 in words is "twenty trillion, one hundred twenty billion, two hundred eleven million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •