Base | Representation |
---|---|
bin | 11101010001000000000… |
… | …110000010111010000011 |
3 | 21010021001102010110020021 |
4 | 131101000012002322003 |
5 | 230422233211133443 |
6 | 4135521253354311 |
7 | 265204300060513 |
oct | 35210006027203 |
9 | 7107042113207 |
10 | 2011120021123 |
11 | 705a02905294 |
12 | 285928038997 |
13 | 1178562c2425 |
14 | 6d4a5683843 |
15 | 374a93789ed |
hex | 1d440182e83 |
2011120021123 has 2 divisors, whose sum is σ = 2011120021124. Its totient is φ = 2011120021122.
The previous prime is 2011120021109. The next prime is 2011120021139. The reversal of 2011120021123 is 3211200211102.
It is an a-pointer prime, because the next prime (2011120021139) can be obtained adding 2011120021123 to its sum of digits (16).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011120021123 is a prime.
It is a super-2 number, since 2×20111200211232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2011120021097 and 2011120021106.
It is not a weakly prime, because it can be changed into another prime (2011120027123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005560010561 + 1005560010562.
It is an arithmetic number, because the mean of its divisors is an integer number (1005560010562).
Almost surely, 22011120021123 is an apocalyptic number.
2011120021123 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011120021123 is an equidigital number, since it uses as much as digits as its factorization.
2011120021123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 2011120021123 its reverse (3211200211102), we get a palindrome (5222320232225).
The spelling of 2011120021123 in words is "two trillion, eleven billion, one hundred twenty million, twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •