Base | Representation |
---|---|
bin | 1010000001100001101010… |
… | …0001100111010111001011 |
3 | 1110000121222111212220001001 |
4 | 2200120122201213113023 |
5 | 2421033141230214011 |
6 | 35235043555035431 |
7 | 2215156600433461 |
oct | 240303241472713 |
9 | 43017874786031 |
10 | 11021331101131 |
11 | 356a136098a0a |
12 | 12a001159bb77 |
13 | 61c3cb805ba0 |
14 | 2a1614556831 |
15 | 141a5420a7c1 |
hex | a061a8675cb |
11021331101131 has 16 divisors (see below), whose sum is σ = 12278742537600. Its totient is φ = 9822455572608.
The previous prime is 11021331101057. The next prime is 11021331101153. The reversal of 11021331101131 is 13110113312011.
It is a cyclic number.
It is not a de Polignac number, because 11021331101131 - 231 = 11019183617483 is a prime.
It is a super-2 number, since 2×110213311011312 (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 = 11021331101099 and 11021331101108.
It is not an unprimeable number, because it can be changed into a prime (11021331101161) 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, 14064030 + ... + 14826988.
It is an arithmetic number, because the mean of its divisors is an integer number (767421408600).
Almost surely, 211021331101131 is an apocalyptic number.
11021331101131 is a deficient number, since it is larger than the sum of its proper divisors (1257411436469).
11021331101131 is a wasteful number, since it uses less digits than its factorization.
11021331101131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 801318.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 11021331101131 its reverse (13110113312011), we get a palindrome (24131444413142).
The spelling of 11021331101131 in words is "eleven trillion, twenty-one billion, three hundred thirty-one million, one hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •