Base | Representation |
---|---|
bin | 1010001101101111111001… |
… | …1100010000001110100111 |
3 | 1110202200222112111101202221 |
4 | 2203123332130100032213 |
5 | 2433003212203043421 |
6 | 35515332155013211 |
7 | 2236302262102006 |
oct | 243337634201647 |
9 | 43680875441687 |
10 | 11231313331111 |
11 | 364019a637255 |
12 | 131485413a207 |
13 | 636153c30103 |
14 | 2ab854292c3d |
15 | 147243bcc841 |
hex | a36fe7103a7 |
11231313331111 has 8 divisors (see below), whose sum is σ = 11890772863920. Its totient is φ = 10578687576192.
The previous prime is 11231313331109. The next prime is 11231313331129. The reversal of 11231313331111 is 11113331313211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11231313331111 - 21 = 11231313331109 is a prime.
It is a super-2 number, since 2×112313133311112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11231313331171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1708441090 + ... + 1708447663.
It is an arithmetic number, because the mean of its divisors is an integer number (1486346607990).
Almost surely, 211231313331111 is an apocalyptic number.
11231313331111 is a deficient number, since it is larger than the sum of its proper divisors (659459532809).
11231313331111 is a wasteful number, since it uses less digits than its factorization.
11231313331111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3416888945.
The product of its digits is 486, while the sum is 25.
Adding to 11231313331111 its reverse (11113331313211), we get a palindrome (22344644644322).
The spelling of 11231313331111 in words is "eleven trillion, two hundred thirty-one billion, three hundred thirteen million, three hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •