Base | Representation |
---|---|
bin | 1010010011000101100011… |
… | …0001010101111011011111 |
3 | 1111002110200221122111021001 |
4 | 2210301120301111323133 |
5 | 2441004022404402033 |
6 | 40025420334051131 |
7 | 2246030032340035 |
oct | 244613061257337 |
9 | 44073627574231 |
10 | 11323023122143 |
11 | 36760813a8687 |
12 | 132a589649aa7 |
13 | 6419ab049355 |
14 | 2b20742a4555 |
15 | 1498101e3e7d |
hex | a4c58c55edf |
11323023122143 has 2 divisors, whose sum is σ = 11323023122144. Its totient is φ = 11323023122142.
The previous prime is 11323023122129. The next prime is 11323023122167. The reversal of 11323023122143 is 34122132032311.
It is a weak prime.
It is an emirp because it is prime and its reverse (34122132032311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11323023122143 - 213 = 11323023113951 is a prime.
It is a super-3 number, since 3×113230231221433 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11323023123143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5661511561071 + 5661511561072.
It is an arithmetic number, because the mean of its divisors is an integer number (5661511561072).
Almost surely, 211323023122143 is an apocalyptic number.
11323023122143 is a deficient number, since it is larger than the sum of its proper divisors (1).
11323023122143 is an equidigital number, since it uses as much as digits as its factorization.
11323023122143 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 11323023122143 its reverse (34122132032311), we get a palindrome (45445155154454).
The spelling of 11323023122143 in words is "eleven trillion, three hundred twenty-three billion, twenty-three million, one hundred twenty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •