Base | Representation |
---|---|
bin | 11101010000111001110… |
… | …001111111100001100101 |
3 | 21010020210000211011021012 |
4 | 131100321301333201211 |
5 | 230422024102213333 |
6 | 4135502551232005 |
7 | 265201542550664 |
oct | 35207161774145 |
9 | 7106700734235 |
10 | 2011014101093 |
11 | 70595903aa78 |
12 | 2858b8678605 |
13 | 11783a38815a |
14 | 6d495590ddb |
15 | 3749ee04e48 |
hex | 1d439c7f865 |
2011014101093 has 2 divisors, whose sum is σ = 2011014101094. Its totient is φ = 2011014101092.
The previous prime is 2011014101081. The next prime is 2011014101153. The reversal of 2011014101093 is 3901014101102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1495097998564 + 515916102529 = 1222742^2 + 718273^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011014101093 - 216 = 2011014035557 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011014101053) 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 as a sum of consecutive naturals, namely, 1005507050546 + 1005507050547.
It is an arithmetic number, because the mean of its divisors is an integer number (1005507050547).
Almost surely, 22011014101093 is an apocalyptic number.
It is an amenable number.
2011014101093 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011014101093 is an equidigital number, since it uses as much as digits as its factorization.
2011014101093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 23.
Adding to 2011014101093 its reverse (3901014101102), we get a palindrome (5912028202195).
The spelling of 2011014101093 in words is "two trillion, eleven billion, fourteen million, one hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •