Base | Representation |
---|---|
bin | 1010100000100110100010… |
… | …0010111111101010000101 |
3 | 1111220200000212120100122201 |
4 | 2220021220202333222011 |
5 | 3003310040300432331 |
6 | 40324220513554501 |
7 | 2301560011444204 |
oct | 250115042775205 |
9 | 44820025510581 |
10 | 11555216030341 |
11 | 37555a3229235 |
12 | 136758a575a31 |
13 | 65a862b4b019 |
14 | 2bd3bdb4323b |
15 | 15089ea5ca61 |
hex | a82688bfa85 |
11555216030341 has 2 divisors, whose sum is σ = 11555216030342. Its totient is φ = 11555216030340.
The previous prime is 11555216030327. The next prime is 11555216030353. The reversal of 11555216030341 is 14303061255511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7832419433316 + 3722796597025 = 2798646^2 + 1929455^2 .
It is a cyclic number.
It is not a de Polignac number, because 11555216030341 - 29 = 11555216029829 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11555216030341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11555216030641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5777608015170 + 5777608015171.
It is an arithmetic number, because the mean of its divisors is an integer number (5777608015171).
Almost surely, 211555216030341 is an apocalyptic number.
It is an amenable number.
11555216030341 is a deficient number, since it is larger than the sum of its proper divisors (1).
11555216030341 is an equidigital number, since it uses as much as digits as its factorization.
11555216030341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54000, while the sum is 37.
Adding to 11555216030341 its reverse (14303061255511), we get a palindrome (25858277285852).
The spelling of 11555216030341 in words is "eleven trillion, five hundred fifty-five billion, two hundred sixteen million, thirty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •