Base | Representation |
---|---|
bin | 1010100000101011010101… |
… | …10111110011001100110111 |
3 | 10000211120201112210212001012 |
4 | 11100111222313303030313 |
5 | 11012140422040013221 |
6 | 121053545433422435 |
7 | 4603600661504525 |
oct | 520255267631467 |
9 | 100746645725035 |
10 | 23113012032311 |
11 | 740119a812323 |
12 | 2713558b6aa1b |
13 | cb8717348976 |
14 | 59c966393315 |
15 | 2a1350d4165b |
hex | 15056adf3337 |
23113012032311 has 8 divisors (see below), whose sum is σ = 23120932351440. Its totient is φ = 23105092957632.
The previous prime is 23113012032307. The next prime is 23113012032389. The reversal of 23113012032311 is 11323021031132.
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 23113012032311 - 22 = 23113012032307 is a prime.
It is a super-2 number, since 2×231130120323112 (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 (23113012032511) 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, 37629755 + ... + 38239043.
It is an arithmetic number, because the mean of its divisors is an integer number (2890116543930).
Almost surely, 223113012032311 is an apocalyptic number.
23113012032311 is a deficient number, since it is larger than the sum of its proper divisors (7920319129).
23113012032311 is an equidigital number, since it uses as much as digits as its factorization.
23113012032311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 622225.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 23113012032311 its reverse (11323021031132), we get a palindrome (34436033063443).
The spelling of 23113012032311 in words is "twenty-three trillion, one hundred thirteen billion, twelve million, thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •