Base | Representation |
---|---|
bin | 1010011110110000001111… |
… | …1010111010010101111101 |
3 | 1111210122001221200211002021 |
4 | 2213230003322322111331 |
5 | 3002300023013431031 |
6 | 40301450021000141 |
7 | 2266354104421456 |
oct | 247540372722575 |
9 | 44718057624067 |
10 | 11523463030141 |
11 | 3743089512207 |
12 | 13613a8553051 |
13 | 6578725407ca |
14 | 2bba4a97812d |
15 | 14eb420b1511 |
hex | a7b03eba57d |
11523463030141 has 2 divisors, whose sum is σ = 11523463030142. Its totient is φ = 11523463030140.
The previous prime is 11523463030133. The next prime is 11523463030169. The reversal of 11523463030141 is 14103036432511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10712175518916 + 811287511225 = 3272946^2 + 900715^2 .
It is a cyclic number.
It is not a de Polignac number, because 11523463030141 - 23 = 11523463030133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11523463030097 and 11523463030106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11523463030111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5761731515070 + 5761731515071.
It is an arithmetic number, because the mean of its divisors is an integer number (5761731515071).
Almost surely, 211523463030141 is an apocalyptic number.
It is an amenable number.
11523463030141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11523463030141 is an equidigital number, since it uses as much as digits as its factorization.
11523463030141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25920, while the sum is 34.
Adding to 11523463030141 its reverse (14103036432511), we get a palindrome (25626499462652).
The spelling of 11523463030141 in words is "eleven trillion, five hundred twenty-three billion, four hundred sixty-three million, thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •