Base | Representation |
---|---|
bin | 1010000111111101111011… |
… | …1110010001011010011101 |
3 | 1110102012122022001212102101 |
4 | 2201333132332101122131 |
5 | 2424341314242131031 |
6 | 35401545401525101 |
7 | 2226155236240333 |
oct | 241773676213235 |
9 | 43365568055371 |
10 | 11132001130141 |
11 | 3602067477801 |
12 | 12b95587a3791 |
13 | 629987a7a458 |
14 | 2a6b12711b53 |
15 | 144880055361 |
hex | a1fdef9169d |
11132001130141 has 2 divisors, whose sum is σ = 11132001130142. Its totient is φ = 11132001130140.
The previous prime is 11132001130109. The next prime is 11132001130171. The reversal of 11132001130141 is 14103110023111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7628257324900 + 3503743805241 = 2761930^2 + 1871829^2 .
It is a cyclic number.
It is not a de Polignac number, because 11132001130141 - 25 = 11132001130109 is a prime.
It is a super-2 number, since 2×111320011301412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11132001130171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5566000565070 + 5566000565071.
It is an arithmetic number, because the mean of its divisors is an integer number (5566000565071).
Almost surely, 211132001130141 is an apocalyptic number.
It is an amenable number.
11132001130141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11132001130141 is an equidigital number, since it uses as much as digits as its factorization.
11132001130141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 11132001130141 its reverse (14103110023111), we get a palindrome (25235111153252).
The spelling of 11132001130141 in words is "eleven trillion, one hundred thirty-two billion, one million, one hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •