Base | Representation |
---|---|
bin | 1010010010011001001011… |
… | …0101010000000010001101 |
3 | 1111001022221212101012202221 |
4 | 2210212102311100002031 |
5 | 2440310124223320323 |
6 | 40020130412215341 |
7 | 2245125623250523 |
oct | 244462265200215 |
9 | 44038855335687 |
10 | 11311112323213 |
11 | 367101a0320aa |
12 | 132820476a551 |
13 | 640830516c31 |
14 | 2b1664466313 |
15 | 1493646e355d |
hex | a4992d5008d |
11311112323213 has 2 divisors, whose sum is σ = 11311112323214. Its totient is φ = 11311112323212.
The previous prime is 11311112323117. The next prime is 11311112323241. The reversal of 11311112323213 is 31232321111311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7689296069764 + 3621816253449 = 2772958^2 + 1903107^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11311112323213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11311112323243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5655556161606 + 5655556161607.
It is an arithmetic number, because the mean of its divisors is an integer number (5655556161607).
Almost surely, 211311112323213 is an apocalyptic number.
It is an amenable number.
11311112323213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11311112323213 is an equidigital number, since it uses as much as digits as its factorization.
11311112323213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 648, while the sum is 25.
Adding to 11311112323213 its reverse (31232321111311), we get a palindrome (42543433434524).
The spelling of 11311112323213 in words is "eleven trillion, three hundred eleven billion, one hundred twelve million, three hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •