Base | Representation |
---|---|
bin | 1010101011111101010100… |
… | …10010100011000000110001 |
3 | 10002012122012211100111000221 |
4 | 11111332222102203000301 |
5 | 11040013234001041022 |
6 | 121552012011213041 |
7 | 4643602230100651 |
oct | 525765222430061 |
9 | 102178184314027 |
10 | 23500623065137 |
11 | 7540616073279 |
12 | 27766b3147181 |
13 | 101613a0748aa |
14 | 5b3617006361 |
15 | 2ab489c84cc7 |
hex | 155faa4a3031 |
23500623065137 has 2 divisors, whose sum is σ = 23500623065138. Its totient is φ = 23500623065136.
The previous prime is 23500623065053. The next prime is 23500623065147. The reversal of 23500623065137 is 73156032600532.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20542278104881 + 2958344960256 = 4532359^2 + 1719984^2 .
It is a cyclic number.
It is not a de Polignac number, because 23500623065137 - 211 = 23500623063089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23500623065093 and 23500623065102.
It is not a weakly prime, because it can be changed into another prime (23500623065147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11750311532568 + 11750311532569.
It is an arithmetic number, because the mean of its divisors is an integer number (11750311532569).
Almost surely, 223500623065137 is an apocalyptic number.
It is an amenable number.
23500623065137 is a deficient number, since it is larger than the sum of its proper divisors (1).
23500623065137 is an equidigital number, since it uses as much as digits as its factorization.
23500623065137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 680400, while the sum is 43.
Adding to 23500623065137 its reverse (73156032600532), we get a palindrome (96656655665669).
The spelling of 23500623065137 in words is "twenty-three trillion, five hundred billion, six hundred twenty-three million, sixty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •