Base | Representation |
---|---|
bin | 1010011110010010111101… |
… | …00000000101101000001001 |
3 | 10000112202112221020122102201 |
4 | 11033021132200011220021 |
5 | 11004320344212023423 |
6 | 120552215352200201 |
7 | 4564643415605035 |
oct | 517113640055011 |
9 | 100482487218381 |
10 | 23031200111113 |
11 | 737a52804a007 |
12 | 26bb726399061 |
13 | cb0aa9a0b93c |
14 | 598a04b1b1c5 |
15 | 29e1637622ad |
hex | 14f25e805a09 |
23031200111113 has 8 divisors (see below), whose sum is σ = 23671042376832. Its totient is φ = 22397600209296.
The previous prime is 23031200111083. The next prime is 23031200111141. The reversal of 23031200111113 is 31111100213032.
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 23031200111113 - 29 = 23031200110601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23031200181113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1560583495 + ... + 1560598252.
It is an arithmetic number, because the mean of its divisors is an integer number (2958880297104).
Almost surely, 223031200111113 is an apocalyptic number.
It is an amenable number.
23031200111113 is a deficient number, since it is larger than the sum of its proper divisors (639842265719).
23031200111113 is a wasteful number, since it uses less digits than its factorization.
23031200111113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3121181951.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 23031200111113 its reverse (31111100213032), we get a palindrome (54142300324145).
The spelling of 23031200111113 in words is "twenty-three trillion, thirty-one billion, two hundred million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •