Base | Representation |
---|---|
bin | 1010010010011000110011… |
… | …0000000110111110101111 |
3 | 1111001022200202102111211222 |
4 | 2210212030300012332233 |
5 | 2440304422114441421 |
6 | 40020112325533555 |
7 | 2245123244211206 |
oct | 244461460067657 |
9 | 44038622374758 |
10 | 11311010312111 |
11 | 3670a77497704 |
12 | 13281965742bb |
13 | 64081534ac33 |
14 | 2b1654ab023d |
15 | 14935a792cab |
hex | a498cc06faf |
11311010312111 has 2 divisors, whose sum is σ = 11311010312112. Its totient is φ = 11311010312110.
The previous prime is 11311010312053. The next prime is 11311010312137. The reversal of 11311010312111 is 11121301011311.
It is a happy number.
11311010312111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11311010312111 - 230 = 11309936570287 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11311010312111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11311010312171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5655505156055 + 5655505156056.
It is an arithmetic number, because the mean of its divisors is an integer number (5655505156056).
Almost surely, 211311010312111 is an apocalyptic number.
11311010312111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11311010312111 is an equidigital number, since it uses as much as digits as its factorization.
11311010312111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 17.
Adding to 11311010312111 its reverse (11121301011311), we get a palindrome (22432311323422).
The spelling of 11311010312111 in words is "eleven trillion, three hundred eleven billion, ten million, three hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •