Base | Representation |
---|---|
bin | 1010000001100100001010… |
… | …0010001001101000010011 |
3 | 1110000200201021220212010101 |
4 | 2200121002202021220103 |
5 | 2421041030044031011 |
6 | 35235234333513231 |
7 | 2215212330665362 |
oct | 240310242115023 |
9 | 43020637825111 |
10 | 11022002330131 |
11 | 356a44aa77221 |
12 | 12a017a342817 |
13 | 61c4a78b0800 |
14 | 2a16797617d9 |
15 | 141a930e82c1 |
hex | a0642889a13 |
11022002330131 has 24 divisors (see below), whose sum is σ = 12687478375824. Its totient is φ = 9537525504000.
The previous prime is 11022002330117. The next prime is 11022002330173. The reversal of 11022002330131 is 13103320022011.
It is not a de Polignac number, because 11022002330131 - 211 = 11022002328083 is a prime.
It is a super-2 number, since 2×110220023301312 (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 = 11022002330099 and 11022002330108.
It is not an unprimeable number, because it can be changed into a prime (11022002337131) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6921126 + ... + 8363371.
It is an arithmetic number, because the mean of its divisors is an integer number (528644932326).
Almost surely, 211022002330131 is an apocalyptic number.
11022002330131 is a deficient number, since it is larger than the sum of its proper divisors (1665476045693).
11022002330131 is a wasteful number, since it uses less digits than its factorization.
11022002330131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15284791 (or 15284778 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 11022002330131 its reverse (13103320022011), we get a palindrome (24125322352142).
The spelling of 11022002330131 in words is "eleven trillion, twenty-two billion, two million, three hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •