Base | Representation |
---|---|
bin | 1010000110110111110000… |
… | …0111001001001100110111 |
3 | 1110100102000102010112012221 |
4 | 2201231330013021030313 |
5 | 2424034224114022411 |
6 | 35345152203423211 |
7 | 2224620346602136 |
oct | 241557407111467 |
9 | 43312012115187 |
10 | 11113162642231 |
11 | 35a507a656a31 |
12 | 12b597b824b07 |
13 | 627c74c0c7a0 |
14 | 2a5c467bb91d |
15 | 14412b271071 |
hex | a1b7c1c9337 |
11113162642231 has 32 divisors (see below), whose sum is σ = 12696237388800. Its totient is φ = 9636432938496.
The previous prime is 11113162642213. The next prime is 11113162642243. The reversal of 11113162642231 is 13224626131111.
It is not a de Polignac number, because 11113162642231 - 223 = 11113154253623 is a prime.
It is a super-2 number, since 2×111131626422312 (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 (11113162642331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 771365230 + ... + 771379636.
It is an arithmetic number, because the mean of its divisors is an integer number (396757418400).
Almost surely, 211113162642231 is an apocalyptic number.
11113162642231 is a deficient number, since it is larger than the sum of its proper divisors (1583074746569).
11113162642231 is a wasteful number, since it uses less digits than its factorization.
11113162642231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20863.
The product of its digits is 10368, while the sum is 34.
Adding to 11113162642231 its reverse (13224626131111), we get a palindrome (24337788773342).
The spelling of 11113162642231 in words is "eleven trillion, one hundred thirteen billion, one hundred sixty-two million, six hundred forty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •