Base | Representation |
---|---|
bin | 1010000000111011100011… |
… | …0000111010110001000011 |
3 | 1102222122120120011110121101 |
4 | 2200032320300322301003 |
5 | 2420401213324323021 |
6 | 35230232512435231 |
7 | 2214345230212033 |
oct | 240167060726103 |
9 | 42878516143541 |
10 | 11011101011011 |
11 | 3565866509882 |
12 | 129a037548b17 |
13 | 61b45b25741a |
14 | 2a0d23a1b8c3 |
15 | 14165604ca91 |
hex | a03b8c3ac43 |
11011101011011 has 2 divisors, whose sum is σ = 11011101011012. Its totient is φ = 11011101011010.
The previous prime is 11011101010967. The next prime is 11011101011039. The reversal of 11011101011011 is 11011010111011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11011101011011 - 213 = 11011101002819 is a prime.
It is not a weakly prime, because it can be changed into another prime (11011101081011) 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, 5505550505505 + 5505550505506.
It is an arithmetic number, because the mean of its divisors is an integer number (5505550505506).
Almost surely, 211011101011011 is an apocalyptic number.
11011101011011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011101011011 is an equidigital number, since it uses as much as digits as its factorization.
11011101011011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 10.
Adding to 11011101011011 its reverse (11011010111011), we get a palindrome (22022111122022).
The spelling of 11011101011011 in words is "eleven trillion, eleven billion, one hundred one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •