Base | Representation |
---|---|
bin | 1010001101110110010011… |
… | …0101000011111010111011 |
3 | 1110202212102020210121212112 |
4 | 2203131210311003322323 |
5 | 2433020221431012311 |
6 | 35520214441002535 |
7 | 2236362661013462 |
oct | 243354465037273 |
9 | 43685366717775 |
10 | 11233031110331 |
11 | 36409a12431a8 |
12 | 131505348344b |
13 | 636368a93014 |
14 | 2ab9784859d9 |
15 | 1472e48e428b |
hex | a3764d43ebb |
11233031110331 has 2 divisors, whose sum is σ = 11233031110332. Its totient is φ = 11233031110330.
The previous prime is 11233031110291. The next prime is 11233031110349. The reversal of 11233031110331 is 13301113033211.
It is a strong prime.
It is an emirp because it is prime and its reverse (13301113033211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11233031110331 is a prime.
It is a super-2 number, since 2×112330311103312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11233031110297 and 11233031110306.
It is not a weakly prime, because it can be changed into another prime (11233031110031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5616515555165 + 5616515555166.
It is an arithmetic number, because the mean of its divisors is an integer number (5616515555166).
Almost surely, 211233031110331 is an apocalyptic number.
11233031110331 is a deficient number, since it is larger than the sum of its proper divisors (1).
11233031110331 is an equidigital number, since it uses as much as digits as its factorization.
11233031110331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 11233031110331 its reverse (13301113033211), we get a palindrome (24534144143542).
The spelling of 11233031110331 in words is "eleven trillion, two hundred thirty-three billion, thirty-one million, one hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •