Base | Representation |
---|---|
bin | 11101001111111110000… |
… | …000001110101011010011 |
3 | 21010011012010200111220002 |
4 | 131033332000032223103 |
5 | 230413000331401321 |
6 | 4135215243440215 |
7 | 265134644205500 |
oct | 35177600165323 |
9 | 7104163614802 |
10 | 2010011200211 |
11 | 705493a15773 |
12 | 28567882606b |
13 | 11770a673791 |
14 | 6d3dc2ca4a7 |
15 | 37441d4e20b |
hex | 1d3fe00ead3 |
2010011200211 has 24 divisors (see below), whose sum is σ = 2467112760000. Its totient is φ = 1628293789584.
The previous prime is 2010011200207. The next prime is 2010011200213. The reversal of 2010011200211 is 1120021100102.
It is not a de Polignac number, because 2010011200211 - 22 = 2010011200207 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2010011200192 and 2010011200201.
It is not an unprimeable number, because it can be changed into a prime (2010011200213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2186261 + ... + 2966438.
It is an arithmetic number, because the mean of its divisors is an integer number (102796365000).
Almost surely, 22010011200211 is an apocalyptic number.
2010011200211 is a deficient number, since it is larger than the sum of its proper divisors (457101559789).
2010011200211 is a wasteful number, since it uses less digits than its factorization.
2010011200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5153151 (or 5153144 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2010011200211 its reverse (1120021100102), we get a palindrome (3130032300313).
The spelling of 2010011200211 in words is "two trillion, ten billion, eleven million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •