Base | Representation |
---|---|
bin | 101101010001101000101… |
… | …010010001001000110011 |
3 | 102000102211200212121002211 |
4 | 231101220222101020303 |
5 | 401433431412424021 |
6 | 10341152254552551 |
7 | 440533134424543 |
oct | 55215052211063 |
9 | 12012750777084 |
10 | 3111312233011 |
11 | a9a555709984 |
12 | 422bb0208757 |
13 | 19751ab58b38 |
14 | aa8344a3323 |
15 | 55debb463e1 |
hex | 2d468a91233 |
3111312233011 has 2 divisors, whose sum is σ = 3111312233012. Its totient is φ = 3111312233010.
The previous prime is 3111312232981. The next prime is 3111312233027. The reversal of 3111312233011 is 1103322131113.
3111312233011 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (1103322131113) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3111312233011 - 27 = 3111312232883 is a prime.
It is a super-2 number, since 2×31113122330112 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3111312833011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1555656116505 + 1555656116506.
It is an arithmetic number, because the mean of its divisors is an integer number (1555656116506).
Almost surely, 23111312233011 is an apocalyptic number.
3111312233011 is a deficient number, since it is larger than the sum of its proper divisors (1).
3111312233011 is an equidigital number, since it uses as much as digits as its factorization.
3111312233011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 3111312233011 its reverse (1103322131113), we get a palindrome (4214634364124).
The spelling of 3111312233011 in words is "three trillion, one hundred eleven billion, three hundred twelve million, two hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •