Base | Representation |
---|---|
bin | 1010011000001101110110… |
… | …0100000000110010111001 |
3 | 1111101220011200120011211222 |
4 | 2212003131210000302321 |
5 | 2443430013441441403 |
6 | 40134113214201425 |
7 | 2255266641350105 |
oct | 246033544006271 |
9 | 44356150504758 |
10 | 11411150343353 |
11 | 36aa494976302 |
12 | 13436831b3275 |
13 | 64a0b3b78ca7 |
14 | 2b6434582905 |
15 | 14bc6be3d338 |
hex | a60dd900cb9 |
11411150343353 has 2 divisors, whose sum is σ = 11411150343354. Its totient is φ = 11411150343352.
The previous prime is 11411150343289. The next prime is 11411150343371. The reversal of 11411150343353 is 35334305111411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7454281444009 + 3956868899344 = 2730253^2 + 1989188^2 .
It is a cyclic number.
It is not a de Polignac number, because 11411150343353 - 26 = 11411150343289 is a prime.
It is not a weakly prime, because it can be changed into another prime (11411150343253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5705575171676 + 5705575171677.
It is an arithmetic number, because the mean of its divisors is an integer number (5705575171677).
Almost surely, 211411150343353 is an apocalyptic number.
It is an amenable number.
11411150343353 is a deficient number, since it is larger than the sum of its proper divisors (1).
11411150343353 is an equidigital number, since it uses as much as digits as its factorization.
11411150343353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 35.
Adding to 11411150343353 its reverse (35334305111411), we get a palindrome (46745455454764).
The spelling of 11411150343353 in words is "eleven trillion, four hundred eleven billion, one hundred fifty million, three hundred forty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •