Base | Representation |
---|---|
bin | 1010100000100101111110… |
… | …10001111011100101101001 |
3 | 10000211022021220210002020211 |
4 | 11100102333101323211221 |
5 | 11012114023044420012 |
6 | 121052352034221121 |
7 | 4603436434032214 |
oct | 520227721734551 |
9 | 100738256702224 |
10 | 23110133201257 |
11 | 73aaa52791a03 |
12 | 2712a94a247a1 |
13 | cb8378aaa43b |
14 | 59c771ccc77b |
15 | 2a12332346a7 |
hex | 1504bf47b969 |
23110133201257 has 2 divisors, whose sum is σ = 23110133201258. Its totient is φ = 23110133201256.
The previous prime is 23110133201227. The next prime is 23110133201327. The reversal of 23110133201257 is 75210233101132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22985849454736 + 124283746521 = 4794356^2 + 352539^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23110133201257 is a prime.
It is a super-2 number, since 2×231101332012572 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23110133201227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11555066600628 + 11555066600629.
It is an arithmetic number, because the mean of its divisors is an integer number (11555066600629).
Almost surely, 223110133201257 is an apocalyptic number.
It is an amenable number.
23110133201257 is a deficient number, since it is larger than the sum of its proper divisors (1).
23110133201257 is an equidigital number, since it uses as much as digits as its factorization.
23110133201257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7560, while the sum is 31.
Adding to 23110133201257 its reverse (75210233101132), we get a palindrome (98320366302389).
The spelling of 23110133201257 in words is "twenty-three trillion, one hundred ten billion, one hundred thirty-three million, two hundred one thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •