Base | Representation |
---|---|
bin | 1010100000100111101000… |
… | …01010000100010100101011 |
3 | 10000211101120202002000022021 |
4 | 11100103310022010110223 |
5 | 11012122332201113311 |
6 | 121053020044405311 |
7 | 4603500425362201 |
oct | 520236412042453 |
9 | 100741522060267 |
10 | 23111020332331 |
11 | 7400368524688 |
12 | 27130a1b46837 |
13 | cb848a819479 |
14 | 59c817a59071 |
15 | 2a128606d171 |
hex | 1504f428452b |
23111020332331 has 2 divisors, whose sum is σ = 23111020332332. Its totient is φ = 23111020332330.
The previous prime is 23111020332329. The next prime is 23111020332343. The reversal of 23111020332331 is 13323302011132.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23111020332331 - 21 = 23111020332329 is a prime.
It is a super-2 number, since 2×231110203323312 (a number of 28 digits) contains 22 as substring.
Together with 23111020332329, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 23111020332296 and 23111020332305.
It is not a weakly prime, because it can be changed into another prime (23111020332311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11555510166165 + 11555510166166.
It is an arithmetic number, because the mean of its divisors is an integer number (11555510166166).
Almost surely, 223111020332331 is an apocalyptic number.
23111020332331 is a deficient number, since it is larger than the sum of its proper divisors (1).
23111020332331 is an equidigital number, since it uses as much as digits as its factorization.
23111020332331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 23111020332331 its reverse (13323302011132), we get a palindrome (36434322343463).
The spelling of 23111020332331 in words is "twenty-three trillion, one hundred eleven billion, twenty million, three hundred thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •