Base | Representation |
---|---|
bin | 1010001101101111001110… |
… | …1000100010100000011011 |
3 | 1110202200111220021221110012 |
4 | 2203123303220202200123 |
5 | 2433002324243033311 |
6 | 35515302200312135 |
7 | 2236264630610453 |
oct | 243336350424033 |
9 | 43680456257405 |
10 | 11231132002331 |
11 | 364010724725a |
12 | 131480347264b |
13 | 6361254b2487 |
14 | 2ab838170d63 |
15 | 147232d1078b |
hex | a36f3a2281b |
11231132002331 has 16 divisors (see below), whose sum is σ = 12021425772960. Its totient is φ = 10460912417280.
The previous prime is 11231132002273. The next prime is 11231132002379. The reversal of 11231132002331 is 13320023113211.
It is a cyclic number.
It is not a de Polignac number, because 11231132002331 - 26 = 11231132002267 is a prime.
It is a super-2 number, since 2×112311320023312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11231132002297 and 11231132002306.
It is not an unprimeable number, because it can be changed into a prime (11231132007331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 426755 + ... + 4758611.
It is an arithmetic number, because the mean of its divisors is an integer number (751339110810).
Almost surely, 211231132002331 is an apocalyptic number.
11231132002331 is a deficient number, since it is larger than the sum of its proper divisors (790293770629).
11231132002331 is a wasteful number, since it uses less digits than its factorization.
11231132002331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4334174.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11231132002331 its reverse (13320023113211), we get a palindrome (24551155115542).
The spelling of 11231132002331 in words is "eleven trillion, two hundred thirty-one billion, one hundred thirty-two million, two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •