Base | Representation |
---|---|
bin | 1010010010011001100111… |
… | …1110111101111101000111 |
3 | 1111001100021020011020020011 |
4 | 2210212121332331331013 |
5 | 2440310400432423421 |
6 | 40020150340051051 |
7 | 2245131611161465 |
oct | 244463176757507 |
9 | 44040236136204 |
10 | 11311232311111 |
11 | 3671080835857 |
12 | 1328238993a87 |
13 | 64084c3384a5 |
14 | 2b167637b835 |
15 | 14936eee54e1 |
hex | a4999fbdf47 |
11311232311111 has 2 divisors, whose sum is σ = 11311232311112. Its totient is φ = 11311232311110.
The previous prime is 11311232311081. The next prime is 11311232311219. The reversal of 11311232311111 is 11111323211311.
It is a happy number.
It is a m-pointer prime, because the next prime (11311232311219) can be obtained adding 11311232311111 to its product of digits (108).
It is a weak prime.
It is an emirp because it is prime and its reverse (11111323211311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11311232311111 - 231 = 11309084827463 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11311232315111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5655616155555 + 5655616155556.
It is an arithmetic number, because the mean of its divisors is an integer number (5655616155556).
Almost surely, 211311232311111 is an apocalyptic number.
11311232311111 is a deficient number, since it is larger than the sum of its proper divisors (1).
11311232311111 is an equidigital number, since it uses as much as digits as its factorization.
11311232311111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 108, while the sum is 22.
Adding to 11311232311111 its reverse (11111323211311), we get a palindrome (22422555522422).
The spelling of 11311232311111 in words is "eleven trillion, three hundred eleven billion, two hundred thirty-two million, three hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •