Base | Representation |
---|---|
bin | 11101010000111010001… |
… | …100010110010001100101 |
3 | 21010020210111211011112102 |
4 | 131100322030112101211 |
5 | 230422032334310041 |
6 | 4135503355301445 |
7 | 265201655354432 |
oct | 35207214262145 |
9 | 7106714734472 |
10 | 2011021010021 |
11 | 705961a29831 |
12 | 2858baa4a885 |
13 | 11783b936a8a |
14 | 6d49646cb89 |
15 | 374a081c09b |
hex | 1d43a316465 |
2011021010021 has 2 divisors, whose sum is σ = 2011021010022. Its totient is φ = 2011021010020.
The previous prime is 2011021009997. The next prime is 2011021010039. The reversal of 2011021010021 is 1200101201102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1561222761121 + 449798248900 = 1249489^2 + 670670^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011021010021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2011021009984 and 2011021010011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011021016021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005510505010 + 1005510505011.
It is an arithmetic number, because the mean of its divisors is an integer number (1005510505011).
Almost surely, 22011021010021 is an apocalyptic number.
It is an amenable number.
2011021010021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011021010021 is an equidigital number, since it uses as much as digits as its factorization.
2011021010021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2011021010021 its reverse (1200101201102), we get a palindrome (3211122211123).
The spelling of 2011021010021 in words is "two trillion, eleven billion, twenty-one million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •