Base | Representation |
---|---|
bin | 11001000010001011100011… |
… | …100110001101101101001111 |
3 | 112102211112221200220002120211 |
4 | 121002023203212031231033 |
5 | 103412343332042030221 |
6 | 1030055412241023251 |
7 | 32122351445351152 |
oct | 3102134346155517 |
9 | 472745850802524 |
10 | 110101010111311 |
11 | 3209963797592a |
12 | 10422391624b27 |
13 | 495863314b4ab |
14 | 1d28cbb1c1c99 |
15 | cadea74796e1 |
hex | 6422e398db4f |
110101010111311 has 2 divisors, whose sum is σ = 110101010111312. Its totient is φ = 110101010111310.
The previous prime is 110101010111233. The next prime is 110101010111317. The reversal of 110101010111311 is 113111010101011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110101010111311 - 227 = 110100875893583 is a prime.
It is a super-2 number, since 2×1101010101113112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110101010111291 and 110101010111300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110101010111317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050505055655 + 55050505055656.
It is an arithmetic number, because the mean of its divisors is an integer number (55050505055656).
Almost surely, 2110101010111311 is an apocalyptic number.
110101010111311 is a deficient number, since it is larger than the sum of its proper divisors (1).
110101010111311 is an equidigital number, since it uses as much as digits as its factorization.
110101010111311 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 110101010111311 its reverse (113111010101011), we get a palindrome (223212020212322).
The spelling of 110101010111311 in words is "one hundred ten trillion, one hundred one billion, ten million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •