Base | Representation |
---|---|
bin | 1010000010110010110111… |
… | …1101011110111011100101 |
3 | 1110002201020212010211010011 |
4 | 2200230231331132323211 |
5 | 2421412313243311323 |
6 | 35253051140130221 |
7 | 2216561051212252 |
oct | 240545575367345 |
9 | 43081225124104 |
10 | 11043132010213 |
11 | 3578403142646 |
12 | 12a4296696971 |
13 | 62149432b5a4 |
14 | 2a26c1ab0429 |
15 | 1423cd10e20d |
hex | a0b2df5eee5 |
11043132010213 has 2 divisors, whose sum is σ = 11043132010214. Its totient is φ = 11043132010212.
The previous prime is 11043132010187. The next prime is 11043132010277. The reversal of 11043132010213 is 31201023134011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6749276655969 + 4293855354244 = 2597937^2 + 2072162^2 .
It is an emirp because it is prime and its reverse (31201023134011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11043132010213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11043132013213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5521566005106 + 5521566005107.
It is an arithmetic number, because the mean of its divisors is an integer number (5521566005107).
Almost surely, 211043132010213 is an apocalyptic number.
It is an amenable number.
11043132010213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11043132010213 is an equidigital number, since it uses as much as digits as its factorization.
11043132010213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11043132010213 its reverse (31201023134011), we get a palindrome (42244155144224).
The spelling of 11043132010213 in words is "eleven trillion, forty-three billion, one hundred thirty-two million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •