Base | Representation |
---|---|
bin | 1010000111111101111011… |
… | …1110010001011001111111 |
3 | 1110102012122022001212101021 |
4 | 2201333132332101121333 |
5 | 2424341314242130421 |
6 | 35401545401525011 |
7 | 2226155236240261 |
oct | 241773676213177 |
9 | 43365568055337 |
10 | 11132001130111 |
11 | 3602067477784 |
12 | 12b95587a3767 |
13 | 629987a7a434 |
14 | 2a6b12711b31 |
15 | 144880055341 |
hex | a1fdef9167f |
11132001130111 has 8 divisors (see below), whose sum is σ = 11171296314464. Its totient is φ = 11092743002880.
The previous prime is 11132001130109. The next prime is 11132001130141. The reversal of 11132001130111 is 11103110023111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11132001130111 - 21 = 11132001130109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11132001130141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8662350 + ... + 9864091.
It is an arithmetic number, because the mean of its divisors is an integer number (1396412039308).
Almost surely, 211132001130111 is an apocalyptic number.
11132001130111 is a deficient number, since it is larger than the sum of its proper divisors (39295184353).
11132001130111 is a wasteful number, since it uses less digits than its factorization.
11132001130111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18528561.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 11132001130111 its reverse (11103110023111), we get a palindrome (22235111153222).
The spelling of 11132001130111 in words is "eleven trillion, one hundred thirty-two billion, one million, one hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •