Base | Representation |
---|---|
bin | 1010000111111111000101… |
… | …1101001000110011010100 |
3 | 1110102020102220112121200210 |
4 | 2201333301131020303110 |
5 | 2424342433132224340 |
6 | 35402040240005420 |
7 | 2226166023004653 |
oct | 241776135106324 |
9 | 43366386477623 |
10 | 11132311211220 |
11 | 3602206507261 |
12 | 12b9624600870 |
13 | 629a07097994 |
14 | 2a6b4198b19a |
15 | 14489c3a6180 |
hex | a1ff1748cd4 |
11132311211220 has 96 divisors (see below), whose sum is σ = 32840612380800. Its totient is φ = 2809837085184.
The previous prime is 11132311211129. The next prime is 11132311211233. The reversal of 11132311211220 is 2211211323111.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 3138439 + ... + 5666958.
It is an arithmetic number, because the mean of its divisors is an integer number (342089712300).
Almost surely, 211132311211220 is an apocalyptic number.
11132311211220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11132311211220 is an abundant number, since it is smaller than the sum of its proper divisors (21708301169580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11132311211220 is a wasteful number, since it uses less digits than its factorization.
11132311211220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8806537 (or 8806535 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 11132311211220 its reverse (2211211323111), we get a palindrome (13343522534331).
The spelling of 11132311211220 in words is "eleven trillion, one hundred thirty-two billion, three hundred eleven million, two hundred eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •