Base | Representation |
---|---|
bin | 1010000110101111101111… |
… | …1111011010101011010011 |
3 | 1110100012110121110010220100 |
4 | 2201223323333122223103 |
5 | 2424020323330224021 |
6 | 35344155020143443 |
7 | 2224513156223331 |
oct | 241537377325323 |
9 | 43305417403810 |
10 | 11111013133011 |
11 | 35a4177282930 |
12 | 12b547b997b83 |
13 | 6279c17a8a3c |
14 | 2a5ac1124b51 |
15 | 1440526c9626 |
hex | a1afbfdaad3 |
11111013133011 has 24 divisors (see below), whose sum is σ = 17508411077040. Its totient is φ = 6733890446400.
The previous prime is 11111013132959. The next prime is 11111013133057. The reversal of 11111013133011 is 11033131011111.
It is not a de Polignac number, because 11111013133011 - 210 = 11111013131987 is a prime.
It is a super-2 number, since 2×111110131330112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11111013131011) 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, 13314585 + ... + 14124453.
It is an arithmetic number, because the mean of its divisors is an integer number (729517128210).
Almost surely, 211111013133011 is an apocalyptic number.
11111013133011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11111013133011 is a deficient number, since it is larger than the sum of its proper divisors (6397397944029).
11111013133011 is a wasteful number, since it uses less digits than its factorization.
11111013133011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 948467 (or 948464 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 18.
Adding to 11111013133011 its reverse (11033131011111), we get a palindrome (22144144144122).
The spelling of 11111013133011 in words is "eleven trillion, one hundred eleven billion, thirteen million, one hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •