Base | Representation |
---|---|
bin | 1010011101110001110100… |
… | …10000010000011111000011 |
3 | 10000111001122020222200101201 |
4 | 11032320322100100133003 |
5 | 11004022432000043243 |
6 | 120540114321442031 |
7 | 4563443543243203 |
oct | 516707220203703 |
9 | 100431566880351 |
10 | 23013412112323 |
11 | 7372a2a1a7266 |
12 | 26b81a11a0317 |
13 | cac2036a8079 |
14 | 597bd8518403 |
15 | 29d971cd404d |
hex | 14ee3a4107c3 |
23013412112323 has 2 divisors, whose sum is σ = 23013412112324. Its totient is φ = 23013412112322.
The previous prime is 23013412112321. The next prime is 23013412112329. The reversal of 23013412112323 is 32321121431032.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23013412112323 - 21 = 23013412112321 is a prime.
It is a super-2 number, since 2×230134121123232 (a number of 28 digits) contains 22 as substring.
Together with 23013412112321, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 23013412112291 and 23013412112300.
It is not a weakly prime, because it can be changed into another prime (23013412112321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11506706056161 + 11506706056162.
It is an arithmetic number, because the mean of its divisors is an integer number (11506706056162).
Almost surely, 223013412112323 is an apocalyptic number.
23013412112323 is a deficient number, since it is larger than the sum of its proper divisors (1).
23013412112323 is an equidigital number, since it uses as much as digits as its factorization.
23013412112323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 23013412112323 its reverse (32321121431032), we get a palindrome (55334533543355).
The spelling of 23013412112323 in words is "twenty-three trillion, thirteen billion, four hundred twelve million, one hundred twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •