Base | Representation |
---|---|
bin | 1010000110110111111100… |
… | …0011100001000101011101 |
3 | 1110100102010212001100002020 |
4 | 2201231333003201011131 |
5 | 2424034324234220013 |
6 | 35345201130050353 |
7 | 2224621516410603 |
oct | 241557703410535 |
9 | 43312125040066 |
10 | 11113212023133 |
11 | 35a50a55145a0 |
12 | 12b59942799b9 |
13 | 627c8220c15c |
14 | 2a5c4d193873 |
15 | 144130777623 |
hex | a1b7f0e115d |
11113212023133 has 16 divisors (see below), whose sum is σ = 16164760507392. Its totient is φ = 6735243150000.
The previous prime is 11113212023047. The next prime is 11113212023141. The reversal of 11113212023133 is 33132021231111.
It is not a de Polignac number, because 11113212023133 - 28 = 11113212022877 is a prime.
It is a super-2 number, since 2×111132120231332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11113212021133) 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 15 ways as a sum of consecutive naturals, for example, 5967708 + ... + 7605258.
It is an arithmetic number, because the mean of its divisors is an integer number (1010297531712).
Almost surely, 211113212023133 is an apocalyptic number.
It is an amenable number.
11113212023133 is a deficient number, since it is larger than the sum of its proper divisors (5051548484259).
11113212023133 is a wasteful number, since it uses less digits than its factorization.
11113212023133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1843216.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 11113212023133 its reverse (33132021231111), we get a palindrome (44245233254244).
The spelling of 11113212023133 in words is "eleven trillion, one hundred thirteen billion, two hundred twelve million, twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •