Base | Representation |
---|---|
bin | 1010000110101011111110… |
… | …1010110111101110011011 |
3 | 1110100002212002011020211011 |
4 | 2201222333222313232123 |
5 | 2424011240241122021 |
6 | 35343510345114351 |
7 | 2224446120213532 |
oct | 241527752675633 |
9 | 43302762136734 |
10 | 11110001114011 |
11 | 35a37a7a9aa98 |
12 | 12b5238a889b7 |
13 | 62788cc21027 |
14 | 2a5a26969319 |
15 | 143ee3921de1 |
hex | a1abfab7b9b |
11110001114011 has 2 divisors, whose sum is σ = 11110001114012. Its totient is φ = 11110001114010.
The previous prime is 11110001113969. The next prime is 11110001114053. The reversal of 11110001114011 is 11041110001111.
It is a balanced prime because it is at equal distance from previous prime (11110001113969) and next prime (11110001114053).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11110001114011 is a prime.
It is a super-2 number, since 2×111100011140112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11110001113982 and 11110001114000.
It is not a weakly prime, because it can be changed into another prime (11110001514011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555000557005 + 5555000557006.
It is an arithmetic number, because the mean of its divisors is an integer number (5555000557006).
Almost surely, 211110001114011 is an apocalyptic number.
11110001114011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110001114011 is an equidigital number, since it uses as much as digits as its factorization.
11110001114011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11110001114011 its reverse (11041110001111), we get a palindrome (22151111115122).
The spelling of 11110001114011 in words is "eleven trillion, one hundred ten billion, one million, one hundred fourteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •