Base | Representation |
---|---|
bin | 1010010011000101100011… |
… | …0001010101111010000101 |
3 | 1111002110200221122111010201 |
4 | 2210301120301111322011 |
5 | 2441004022404401203 |
6 | 40025420334050501 |
7 | 2246030032336546 |
oct | 244613061257205 |
9 | 44073627574121 |
10 | 11323023122053 |
11 | 36760813a8605 |
12 | 132a589649a31 |
13 | 6419ab0492b6 |
14 | 2b20742a44cd |
15 | 1498101e3e1d |
hex | a4c58c55e85 |
11323023122053 has 2 divisors, whose sum is σ = 11323023122054. Its totient is φ = 11323023122052.
The previous prime is 11323023122041. The next prime is 11323023122129. The reversal of 11323023122053 is 35022132032311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9570002105764 + 1753021016289 = 3093542^2 + 1324017^2 .
It is an emirp because it is prime and its reverse (35022132032311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11323023122053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11323023122003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5661511561026 + 5661511561027.
It is an arithmetic number, because the mean of its divisors is an integer number (5661511561027).
Almost surely, 211323023122053 is an apocalyptic number.
It is an amenable number.
11323023122053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11323023122053 is an equidigital number, since it uses as much as digits as its factorization.
11323023122053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 11323023122053 its reverse (35022132032311), we get a palindrome (46345155154364).
The spelling of 11323023122053 in words is "eleven trillion, three hundred twenty-three billion, twenty-three million, one hundred twenty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •