Base | Representation |
---|---|
bin | 1010001101110111000011… |
… | …0100101000001010001101 |
3 | 1110202212221021102022001111 |
4 | 2203131300310220022031 |
5 | 2433021124433320323 |
6 | 35520250425412021 |
7 | 2236400653212115 |
oct | 243356064501215 |
9 | 43685837368044 |
10 | 11233232323213 |
11 | 3640a9488443a |
12 | 13150aa93a011 |
13 | 63639b6833b4 |
14 | 2ab9970a2045 |
15 | 1473073dcc0d |
hex | a3770d2828d |
11233232323213 has 2 divisors, whose sum is σ = 11233232323214. Its totient is φ = 11233232323212.
The previous prime is 11233232323171. The next prime is 11233232323241. The reversal of 11233232323213 is 31232323233211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8005040345124 + 3228191978089 = 2829318^2 + 1796717^2 .
It is an emirp because it is prime and its reverse (31232323233211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11233232323213 - 29 = 11233232322701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11233232323613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5616616161606 + 5616616161607.
It is an arithmetic number, because the mean of its divisors is an integer number (5616616161607).
Almost surely, 211233232323213 is an apocalyptic number.
It is an amenable number.
11233232323213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11233232323213 is an equidigital number, since it uses as much as digits as its factorization.
11233232323213 is an evil number, because the sum of its binary digits is even.
The product of its digits is 23328, while the sum is 31.
Adding to 11233232323213 its reverse (31232323233211), we get a palindrome (42465555556424).
The spelling of 11233232323213 in words is "eleven trillion, two hundred thirty-three billion, two hundred thirty-two million, three hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •