Base | Representation |
---|---|
bin | 1010100110011110000000… |
… | …01100011110011001101001 |
3 | 10001112121101012101012100110 |
4 | 11103033000030132121221 |
5 | 11023421000033323423 |
6 | 121325220201524533 |
7 | 4624144250432040 |
oct | 523170014363151 |
9 | 101477335335313 |
10 | 23312012011113 |
11 | 7478629045821 |
12 | 27460357a3749 |
13 | 100140c421107 |
14 | 5a844371d557 |
15 | 2a65eb5cd193 |
hex | 1533c031e669 |
23312012011113 has 16 divisors (see below), whose sum is σ = 35636558155136. Its totient is φ = 13278590133120.
The previous prime is 23312012010971. The next prime is 23312012011121. The reversal of 23312012011113 is 31111021021332.
It is not a de Polignac number, because 23312012011113 - 226 = 23311944902249 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23312012011113.
It is not an unprimeable number, because it can be changed into a prime (23312012011133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1773309418 + ... + 1773322563.
It is an arithmetic number, because the mean of its divisors is an integer number (2227284884696).
Almost surely, 223312012011113 is an apocalyptic number.
It is an amenable number.
23312012011113 is a deficient number, since it is larger than the sum of its proper divisors (12324546144023).
23312012011113 is a wasteful number, since it uses less digits than its factorization.
23312012011113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3546632304.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 23312012011113 its reverse (31111021021332), we get a palindrome (54423033032445).
The spelling of 23312012011113 in words is "twenty-three trillion, three hundred twelve billion, twelve million, eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •