Base | Representation |
---|---|
bin | 1010100000100111110011… |
… | …00011111110111111100011 |
3 | 10000211101211001201000212111 |
4 | 11100103321203332333203 |
5 | 11012123023404343243 |
6 | 121053033044140151 |
7 | 4603502606216305 |
oct | 520237143767743 |
9 | 100741731630774 |
10 | 23111111012323 |
11 | 740040472a924 |
12 | 2713108397657 |
13 | cb84a3548a79 |
14 | 59c825b01975 |
15 | 2a128ded139d |
hex | 1504f98fefe3 |
23111111012323 has 4 divisors (see below), whose sum is σ = 23648578710328. Its totient is φ = 22573643314320.
The previous prime is 23111111012309. The next prime is 23111111012359. The reversal of 23111111012323 is 32321011111132.
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 23111111012323 - 217 = 23111110881251 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23111111012294 and 23111111012303.
It is not an unprimeable number, because it can be changed into a prime (23111111012393) 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, 268733848938 + ... + 268733849023.
It is an arithmetic number, because the mean of its divisors is an integer number (5912144677582).
Almost surely, 223111111012323 is an apocalyptic number.
23111111012323 is a deficient number, since it is larger than the sum of its proper divisors (537467698005).
23111111012323 is an equidigital number, since it uses as much as digits as its factorization.
23111111012323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537467698004.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 23111111012323 its reverse (32321011111132), we get a palindrome (55432122123455).
The spelling of 23111111012323 in words is "twenty-three trillion, one hundred eleven billion, one hundred eleven million, twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •