Base | Representation |
---|---|
bin | 1010100110100000101010… |
… | …10100101101001011000011 |
3 | 10001112202001201211100021012 |
4 | 11103100111110231023003 |
5 | 11023431411144412011 |
6 | 121330014021351135 |
7 | 4624224532213520 |
oct | 523202524551303 |
9 | 101482051740235 |
10 | 23313440232131 |
11 | 74791a125a375 |
12 | 2746373b684ab |
13 | 10015a92a0bca |
14 | 5a853b29a147 |
15 | 2a6681b99a8b |
hex | 15341552d2c3 |
23313440232131 has 8 divisors (see below), whose sum is σ = 27503413361664. Its totient is φ = 19338337519560.
The previous prime is 23313440232127. The next prime is 23313440232151. The reversal of 23313440232131 is 13123204431332.
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 23313440232131 - 22 = 23313440232127 is a prime.
It is a super-2 number, since 2×233134402321312 (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 (23313440232151) 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, 53717604005 + ... + 53717604438.
It is an arithmetic number, because the mean of its divisors is an integer number (3437926670208).
Almost surely, 223313440232131 is an apocalyptic number.
23313440232131 is a deficient number, since it is larger than the sum of its proper divisors (4189973129533).
23313440232131 is a wasteful number, since it uses less digits than its factorization.
23313440232131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107435208481.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 23313440232131 its reverse (13123204431332), we get a palindrome (36436644663463).
The spelling of 23313440232131 in words is "twenty-three trillion, three hundred thirteen billion, four hundred forty million, two hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •