Base | Representation |
---|---|
bin | 1010000010110010110111… |
… | …1010100001001111101011 |
3 | 1110002201020210200100100002 |
4 | 2200230231322201033223 |
5 | 2421412313043431014 |
6 | 35253051111333215 |
7 | 2216561041465136 |
oct | 240545572411753 |
9 | 43081223610302 |
10 | 11043131233259 |
11 | 3578402761934 |
12 | 12a429638120b |
13 | 621494118a58 |
14 | 2a26c194b21d |
15 | 1423cd008dde |
hex | a0b2dea13eb |
11043131233259 has 2 divisors, whose sum is σ = 11043131233260. Its totient is φ = 11043131233258.
The previous prime is 11043131233229. The next prime is 11043131233261. The reversal of 11043131233259 is 95233213134011.
It is a strong prime.
It is an emirp because it is prime and its reverse (95233213134011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11043131233259 - 220 = 11043130184683 is a prime.
It is a super-2 number, since 2×110431312332592 (a number of 27 digits) contains 22 as substring.
Together with 11043131233261, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (11043131233219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5521565616629 + 5521565616630.
It is an arithmetic number, because the mean of its divisors is an integer number (5521565616630).
Almost surely, 211043131233259 is an apocalyptic number.
11043131233259 is a deficient number, since it is larger than the sum of its proper divisors (1).
11043131233259 is an equidigital number, since it uses as much as digits as its factorization.
11043131233259 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 38.
The spelling of 11043131233259 in words is "eleven trillion, forty-three billion, one hundred thirty-one million, two hundred thirty-three thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •