Base | Representation |
---|---|
bin | 1010011110100011100011… |
… | …10011111101101011000111 |
3 | 10000120121120011100021220112 |
4 | 11033101301303331223013 |
5 | 11004442123142214421 |
6 | 121000252100223235 |
7 | 4565410334605463 |
oct | 517216163755307 |
9 | 100517504307815 |
10 | 23040114023111 |
11 | 7383291791029 |
12 | 27013b369ab1b |
13 | cb189a6a9793 |
14 | 59920c9234a3 |
15 | 29e4d60d645b |
hex | 14f471cfdac7 |
23040114023111 has 4 divisors (see below), whose sum is σ = 23194745661000. Its totient is φ = 22885482385224.
The previous prime is 23040114023093. The next prime is 23040114023153. The reversal of 23040114023111 is 11132041104032.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23040114023111 - 218 = 23040113760967 is a prime.
It is a super-2 number, since 2×230401140231112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23040114023191) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 77315818721 + ... + 77315819018.
It is an arithmetic number, because the mean of its divisors is an integer number (5798686415250).
Almost surely, 223040114023111 is an apocalyptic number.
23040114023111 is a deficient number, since it is larger than the sum of its proper divisors (154631637889).
23040114023111 is a wasteful number, since it uses less digits than its factorization.
23040114023111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154631637888.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 23040114023111 its reverse (11132041104032), we get a palindrome (34172155127143).
The spelling of 23040114023111 in words is "twenty-three trillion, forty billion, one hundred fourteen million, twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •