Base | Representation |
---|---|
bin | 101101101110011010000110… |
… | …001111110010111011010100 |
3 | 222101001002101011110001211020 |
4 | 231232122012033302323110 |
5 | 202324320240010133022 |
6 | 1551412342043241140 |
7 | 60234040323461541 |
oct | 5556320617627324 |
9 | 871032334401736 |
10 | 201101211021012 |
11 | 590935a9a18355 |
12 | 1a67a9188191b0 |
13 | 88299bbc19b23 |
14 | 37934c9c89bc8 |
15 | 183b18600635c |
hex | b6e6863f2ed4 |
201101211021012 has 96 divisors (see below), whose sum is σ = 503990893929600. Its totient is φ = 62188772904960.
The previous prime is 201101211020999. The next prime is 201101211021017. The reversal of 201101211021012 is 210120112101102.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 201101211020982 and 201101211021000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201101211021017) 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, 21270193 + ... + 29233944.
It is an arithmetic number, because the mean of its divisors is an integer number (5249905145100).
Almost surely, 2201101211021012 is an apocalyptic number.
It is an amenable number.
201101211021012 is an abundant number, since it is smaller than the sum of its proper divisors (302889682908588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201101211021012 is a wasteful number, since it uses less digits than its factorization.
201101211021012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50504441 (or 50504439 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 201101211021012 its reverse (210120112101102), we get a palindrome (411221323122114).
The spelling of 201101211021012 in words is "two hundred one trillion, one hundred one billion, two hundred eleven million, twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •