Base | Representation |
---|---|
bin | 11101001111111101111… |
… | …111100010111100111001 |
3 | 21010011012010100102012211 |
4 | 131033331333202330321 |
5 | 230413000310133423 |
6 | 4135215235535121 |
7 | 265134642531364 |
oct | 35177577427471 |
9 | 7104163312184 |
10 | 2010011021113 |
11 | 705493903157 |
12 | 28567875a4a1 |
13 | 11770a6100c4 |
14 | 6d3dc2810db |
15 | 37441d1610d |
hex | 1d3fdfe2f39 |
2010011021113 has 2 divisors, whose sum is σ = 2010011021114. Its totient is φ = 2010011021112.
The previous prime is 2010011021101. The next prime is 2010011021159. The reversal of 2010011021113 is 3111201100102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1081491842704 + 928519178409 = 1039948^2 + 963597^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010011021113 - 29 = 2010011020601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2010011021093 and 2010011021102.
It is not a weakly prime, because it can be changed into another prime (2010011021413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005005510556 + 1005005510557.
It is an arithmetic number, because the mean of its divisors is an integer number (1005005510557).
Almost surely, 22010011021113 is an apocalyptic number.
It is an amenable number.
2010011021113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010011021113 is an equidigital number, since it uses as much as digits as its factorization.
2010011021113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 2010011021113 its reverse (3111201100102), we get a palindrome (5121212121215).
The spelling of 2010011021113 in words is "two trillion, ten billion, eleven million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •