Base | Representation |
---|---|
bin | 1010100000100110010011… |
… | …11000010010110100000111 |
3 | 10000211022202022101201110102 |
4 | 11100103021320102310013 |
5 | 11012114404110430043 |
6 | 121052421425514315 |
7 | 4603444023405350 |
oct | 520231170226407 |
9 | 100738668351412 |
10 | 23110311030023 |
11 | 7400034101328 |
12 | 2712b244a299b |
13 | cb83a68a0c69 |
14 | 59c78b77cd27 |
15 | 2a1243b5e6b8 |
hex | 1504c9e12d07 |
23110311030023 has 16 divisors (see below), whose sum is σ = 26969017035840. Its totient is φ = 19394874648576.
The previous prime is 23110311030019. The next prime is 23110311030049. The reversal of 23110311030023 is 32003011301132.
It is not a de Polignac number, because 23110311030023 - 22 = 23110311030019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23110311029977 and 23110311030004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23110311330023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 164987138 + ... + 165127151.
It is an arithmetic number, because the mean of its divisors is an integer number (1685563564740).
Almost surely, 223110311030023 is an apocalyptic number.
23110311030023 is a deficient number, since it is larger than the sum of its proper divisors (3858706005817).
23110311030023 is a wasteful number, since it uses less digits than its factorization.
23110311030023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 330114506.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 23110311030023 its reverse (32003011301132), we get a palindrome (55113322331155).
The spelling of 23110311030023 in words is "twenty-three trillion, one hundred ten billion, three hundred eleven million, thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •