Base | Representation |
---|---|
bin | 1010010100010100001011… |
… | …1101101111011011100101 |
3 | 1111011111012001221011221002 |
4 | 2211011002331233123211 |
5 | 2441330240310010203 |
6 | 40043231121003045 |
7 | 2250405111642611 |
oct | 245050275573345 |
9 | 44144161834832 |
10 | 11344132110053 |
11 | 3684023920736 |
12 | 133269aa83485 |
13 | 643993400942 |
14 | 2b30b7988341 |
15 | 14a1484bdd88 |
hex | a5142f6f6e5 |
11344132110053 has 2 divisors, whose sum is σ = 11344132110054. Its totient is φ = 11344132110052.
The previous prime is 11344132110049. The next prime is 11344132110109. The reversal of 11344132110053 is 35001123144311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11338150325089 + 5981784964 = 3367217^2 + 77342^2 .
It is a cyclic number.
It is not a de Polignac number, because 11344132110053 - 22 = 11344132110049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11344132109998 and 11344132110025.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11344132110043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5672066055026 + 5672066055027.
It is an arithmetic number, because the mean of its divisors is an integer number (5672066055027).
Almost surely, 211344132110053 is an apocalyptic number.
It is an amenable number.
11344132110053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11344132110053 is an equidigital number, since it uses as much as digits as its factorization.
11344132110053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 11344132110053 its reverse (35001123144311), we get a palindrome (46345255254364).
The spelling of 11344132110053 in words is "eleven trillion, three hundred forty-four billion, one hundred thirty-two million, one hundred ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •