Base | Representation |
---|---|
bin | 1010000001000011110010… |
… | …0011101011100000111101 |
3 | 1102222212021122210010000002 |
4 | 2200100330203223200331 |
5 | 2420420230401230211 |
6 | 35231240140444045 |
7 | 2214454066353251 |
oct | 240207443534075 |
9 | 42885248703002 |
10 | 11013312133181 |
11 | 35667a0645676 |
12 | 129a553b49625 |
13 | 61b721381337 |
14 | 2a1093552261 |
15 | 14173521503b |
hex | a043c8eb83d |
11013312133181 has 2 divisors, whose sum is σ = 11013312133182. Its totient is φ = 11013312133180.
The previous prime is 11013312133157. The next prime is 11013312133193. The reversal of 11013312133181 is 18133121331011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6580076607556 + 4433235525625 = 2565166^2 + 2105525^2 .
It is a cyclic number.
It is not a de Polignac number, because 11013312133181 - 214 = 11013312116797 is a prime.
It is a super-2 number, since 2×110133121331812 (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 (11013312135181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506656066590 + 5506656066591.
It is an arithmetic number, because the mean of its divisors is an integer number (5506656066591).
Almost surely, 211013312133181 is an apocalyptic number.
It is an amenable number.
11013312133181 is a deficient number, since it is larger than the sum of its proper divisors (1).
11013312133181 is an equidigital number, since it uses as much as digits as its factorization.
11013312133181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 29.
Adding to 11013312133181 its reverse (18133121331011), we get a palindrome (29146433464192).
The spelling of 11013312133181 in words is "eleven trillion, thirteen billion, three hundred twelve million, one hundred thirty-three thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •