Base | Representation |
---|---|
bin | 1010100000101011010101… |
… | …10100010010100101111001 |
3 | 10000211120201111002010001012 |
4 | 11100111222310102211321 |
5 | 11012140421321043223 |
6 | 121053545402003305 |
7 | 4603600650623363 |
oct | 520255264224571 |
9 | 100746644063035 |
10 | 23113011112313 |
11 | 740119a2440a1 |
12 | 27135587a6535 |
13 | cb87170b5ca5 |
14 | 59c9661d3d33 |
15 | 2a1350c0dc78 |
hex | 15056ad12979 |
23113011112313 has 8 divisors (see below), whose sum is σ = 24366221736960. Its totient is φ = 21891527339040.
The previous prime is 23113011112291. The next prime is 23113011112393. The reversal of 23113011112313 is 31321111031132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23113011112313 - 28 = 23113011112057 is a prime.
It is a super-2 number, since 2×231130111123132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23113011112393) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7931711348 + ... + 7931714261.
It is an arithmetic number, because the mean of its divisors is an integer number (3045777717120).
Almost surely, 223113011112313 is an apocalyptic number.
It is an amenable number.
23113011112313 is a deficient number, since it is larger than the sum of its proper divisors (1253210624647).
23113011112313 is a wasteful number, since it uses less digits than its factorization.
23113011112313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15863425687.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 23113011112313 its reverse (31321111031132), we get a palindrome (54434122143445).
The spelling of 23113011112313 in words is "twenty-three trillion, one hundred thirteen billion, eleven million, one hundred twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •