Base | Representation |
---|---|
bin | 1010000001100000111010… |
… | …0111000101111001011011 |
3 | 1110000121110120202101102002 |
4 | 2200120032213011321123 |
5 | 2421032234042212311 |
6 | 35235012054431215 |
7 | 2215151622412454 |
oct | 240301647057133 |
9 | 43017416671362 |
10 | 11021131210331 |
11 | 356a043280000 |
12 | 129bb7666250b |
13 | 61c3992894c8 |
14 | 2a15d5ba212b |
15 | 141a418c393b |
hex | a060e9c5e5b |
11021131210331 has 20 divisors (see below), whose sum is σ = 12139323868320. Its totient is φ = 10005859050000.
The previous prime is 11021131210301. The next prime is 11021131210333. The reversal of 11021131210331 is 13301213112011.
It is a de Polignac number, because none of the positive numbers 2k-11021131210331 is a prime.
It is a super-2 number, since 2×110211312103312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11021131210333) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 10494221 + ... + 11496561.
It is an arithmetic number, because the mean of its divisors is an integer number (606966193416).
Almost surely, 211021131210331 is an apocalyptic number.
11021131210331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11021131210331 is a deficient number, since it is larger than the sum of its proper divisors (1118192657989).
11021131210331 is an frugal number, since it uses more digits than its factorization.
11021131210331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1003136 (or 1003103 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 11021131210331 its reverse (13301213112011), we get a palindrome (24322344322342).
The spelling of 11021131210331 in words is "eleven trillion, twenty-one billion, one hundred thirty-one million, two hundred ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •