Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …0011101010101001001011 |
3 | 1102222122121012022020210202 |
4 | 2200032321103222221023 |
5 | 2420401223142320021 |
6 | 35230233440002415 |
7 | 2214345400510631 |
oct | 240167123525113 |
9 | 42878535266722 |
10 | 11011110120011 |
11 | 3565870670581 |
12 | 129a03a60040b |
13 | 61b4600c6571 |
14 | 2a0d24d0d351 |
15 | 141656c4ba0b |
hex | a03b94eaa4b |
11011110120011 has 2 divisors, whose sum is σ = 11011110120012. Its totient is φ = 11011110120010.
The previous prime is 11011110119969. The next prime is 11011110120053. The reversal of 11011110120011 is 11002101111011.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (11011110119969) and next prime (11011110120053).
It is an emirp because it is prime and its reverse (11002101111011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011110120011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11011110119974 and 11011110120001.
It is not a weakly prime, because it can be changed into another prime (11011110120061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505555060005 + 5505555060006.
It is an arithmetic number, because the mean of its divisors is an integer number (5505555060006).
Almost surely, 211011110120011 is an apocalyptic number.
11011110120011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011110120011 is an equidigital number, since it uses as much as digits as its factorization.
11011110120011 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 11.
Adding to 11011110120011 its reverse (11002101111011), we get a palindrome (22013211231022).
The spelling of 11011110120011 in words is "eleven trillion, eleven billion, one hundred ten million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •