Base | Representation |
---|---|
bin | 11001000000110110110011… |
… | …101000100100111110001111 |
3 | 112102111212001211012221002111 |
4 | 121000312303220210332033 |
5 | 103404401000321030221 |
6 | 1025545522412404451 |
7 | 32112650425540153 |
oct | 3100666350447617 |
9 | 472455054187074 |
10 | 110010011111311 |
11 | 32063a90354303 |
12 | 10408816176727 |
13 | 494cb9037c26c |
14 | 1d24727757063 |
15 | cab92d567be1 |
hex | 640db3a24f8f |
110010011111311 has 2 divisors, whose sum is σ = 110010011111312. Its totient is φ = 110010011111310.
The previous prime is 110010011111279. The next prime is 110010011111327. The reversal of 110010011111311 is 113111110010011.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (113111110010011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110010011111311 - 25 = 110010011111279 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110010011111291 and 110010011111300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110010011111411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005005555655 + 55005005555656.
It is an arithmetic number, because the mean of its divisors is an integer number (55005005555656).
Almost surely, 2110010011111311 is an apocalyptic number.
110010011111311 is a deficient number, since it is larger than the sum of its proper divisors (1).
110010011111311 is an equidigital number, since it uses as much as digits as its factorization.
110010011111311 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 13.
Adding to 110010011111311 its reverse (113111110010011), we get a palindrome (223121121121322).
The spelling of 110010011111311 in words is "one hundred ten trillion, ten billion, eleven million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •