Base | Representation |
---|---|
bin | 1010011110101111101011… |
… | …0100011110111101010001 |
3 | 1111210121200022101212112012 |
4 | 2213223322310132331101 |
5 | 3002244214422201121 |
6 | 40301422524312305 |
7 | 2266350241600361 |
oct | 247537264367521 |
9 | 44717608355465 |
10 | 11523310350161 |
11 | 374301030a505 |
12 | 13613653a2695 |
13 | 657849a13b1c |
14 | 2bba345929a1 |
15 | 14eb339a2c5b |
hex | a7afad1ef51 |
11523310350161 has 2 divisors, whose sum is σ = 11523310350162. Its totient is φ = 11523310350160.
The previous prime is 11523310350131. The next prime is 11523310350217. The reversal of 11523310350161 is 16105301332511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7912018234561 + 3611292115600 = 2812831^2 + 1900340^2 .
It is a cyclic number.
It is not a de Polignac number, because 11523310350161 - 226 = 11523243241297 is a prime.
It is a super-2 number, since 2×115233103501612 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11523310350131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5761655175080 + 5761655175081.
It is an arithmetic number, because the mean of its divisors is an integer number (5761655175081).
Almost surely, 211523310350161 is an apocalyptic number.
It is an amenable number.
11523310350161 is a deficient number, since it is larger than the sum of its proper divisors (1).
11523310350161 is an equidigital number, since it uses as much as digits as its factorization.
11523310350161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 32.
Adding to 11523310350161 its reverse (16105301332511), we get a palindrome (27628611682672).
The spelling of 11523310350161 in words is "eleven trillion, five hundred twenty-three billion, three hundred ten million, three hundred fifty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •