Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …0101101111101111110111 |
3 | 1102222122100012220201120222 |
4 | 2200032303111233233313 |
5 | 2420401022030030121 |
6 | 35230215502044555 |
7 | 2214343043514263 |
oct | 240166325575767 |
9 | 42878305821528 |
10 | 11011010001911 |
11 | 356581a0a9347 |
12 | 129a010b7975b |
13 | 61b44544109a |
14 | 2a0d158cb0a3 |
15 | 14164d0720ab |
hex | a03b356fbf7 |
11011010001911 has 2 divisors, whose sum is σ = 11011010001912. Its totient is φ = 11011010001910.
The previous prime is 11011010001869. The next prime is 11011010001949. The reversal of 11011010001911 is 11910001011011.
It is a strong prime.
It is an emirp because it is prime and its reverse (11910001011011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11011010001911 - 26 = 11011010001847 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11011010001911.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011010003911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505505000955 + 5505505000956.
It is an arithmetic number, because the mean of its divisors is an integer number (5505505000956).
Almost surely, 211011010001911 is an apocalyptic number.
11011010001911 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011010001911 is an equidigital number, since it uses as much as digits as its factorization.
11011010001911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 17.
Adding to 11011010001911 its reverse (11910001011011), we get a palindrome (22921011012922).
The spelling of 11011010001911 in words is "eleven trillion, eleven billion, ten million, one thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •