Base | Representation |
---|---|
bin | 1010010010111011000100… |
… | …1110100100100101010101 |
3 | 1111002012110001102110111221 |
4 | 2210232301032210211111 |
5 | 2440432243311241203 |
6 | 40024233402330341 |
7 | 2245600261111633 |
oct | 244566116444525 |
9 | 44065401373457 |
10 | 11320212212053 |
11 | 3674969749298 |
12 | 1329b241b99b1 |
13 | 64165089c244 |
14 | 2b1c88c40353 |
15 | 1496e8551abd |
hex | a4bb13a4955 |
11320212212053 has 2 divisors, whose sum is σ = 11320212212054. Its totient is φ = 11320212212052.
The previous prime is 11320212212021. The next prime is 11320212212077. The reversal of 11320212212053 is 35021221202311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11305888430929 + 14323781124 = 3362423^2 + 119682^2 .
It is an emirp because it is prime and its reverse (35021221202311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11320212212053 - 25 = 11320212212021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11320212212753) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660106106026 + 5660106106027.
It is an arithmetic number, because the mean of its divisors is an integer number (5660106106027).
Almost surely, 211320212212053 is an apocalyptic number.
It is an amenable number.
11320212212053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11320212212053 is an equidigital number, since it uses as much as digits as its factorization.
11320212212053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 11320212212053 its reverse (35021221202311), we get a palindrome (46341433414364).
The spelling of 11320212212053 in words is "eleven trillion, three hundred twenty billion, two hundred twelve million, two hundred twelve thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •