Base | Representation |
---|---|
bin | 1010000001011100101111… |
… | …0010000000111010001011 |
3 | 1110000111120102222222222221 |
4 | 2200113023302000322023 |
5 | 2421022440030000021 |
6 | 35234304523154511 |
7 | 2215112056316635 |
oct | 240271362007213 |
9 | 43014512888887 |
10 | 11020010000011 |
11 | 3569618399101 |
12 | 129b903075a37 |
13 | 61c24abc054c |
14 | 2a152ad01a55 |
15 | 1419c824d241 |
hex | a05cbc80e8b |
11020010000011 has 2 divisors, whose sum is σ = 11020010000012. Its totient is φ = 11020010000010.
The previous prime is 11020010000003. The next prime is 11020010000017. The reversal of 11020010000011 is 11000001002011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11020010000011 - 23 = 11020010000003 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11020009999949 and 11020010000003.
It is not a weakly prime, because it can be changed into another prime (11020010000017) 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, 5510005000005 + 5510005000006.
It is an arithmetic number, because the mean of its divisors is an integer number (5510005000006).
Almost surely, 211020010000011 is an apocalyptic number.
11020010000011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020010000011 is an equidigital number, since it uses as much as digits as its factorization.
11020010000011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 11020010000011 its reverse (11000001002011), we get a palindrome (22020011002022).
The spelling of 11020010000011 in words is "eleven trillion, twenty billion, ten million, eleven", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •