Base | Representation |
---|---|
bin | 1010000010110111011000… |
… | …0111010000010010001101 |
3 | 1110002211101012221122202021 |
4 | 2200231312013100102031 |
5 | 2421422303141444323 |
6 | 35253411221530141 |
7 | 2216633050400065 |
oct | 240556607202215 |
9 | 43084335848667 |
10 | 11044342531213 |
11 | 3578974484a22 |
12 | 12a4573b73951 |
13 | 6216280677c4 |
14 | 2a279877c3a5 |
15 | 14244e52705d |
hex | a0b761d048d |
11044342531213 has 2 divisors, whose sum is σ = 11044342531214. Its totient is φ = 11044342531212.
The previous prime is 11044342531199. The next prime is 11044342531259. The reversal of 11044342531213 is 31213524344011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11036069355364 + 8273175849 = 3322058^2 + 90957^2 .
It is a cyclic number.
It is not a de Polignac number, because 11044342531213 - 25 = 11044342531181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11044342531513) 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, 5522171265606 + 5522171265607.
It is an arithmetic number, because the mean of its divisors is an integer number (5522171265607).
Almost surely, 211044342531213 is an apocalyptic number.
It is an amenable number.
11044342531213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11044342531213 is an equidigital number, since it uses as much as digits as its factorization.
11044342531213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34560, while the sum is 34.
Adding to 11044342531213 its reverse (31213524344011), we get a palindrome (42257866875224).
The spelling of 11044342531213 in words is "eleven trillion, forty-four billion, three hundred forty-two million, five hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •