Base | Representation |
---|---|
bin | 1010011101101011011111… |
… | …00010100010100010011101 |
3 | 10000110201212020102212201221 |
4 | 11032311233202202202131 |
5 | 11003444000322130023 |
6 | 120534353030533341 |
7 | 4563263345334655 |
oct | 516655742424235 |
9 | 100421766385657 |
10 | 23010011130013 |
11 | 737154445a986 |
12 | 26b75b2207251 |
13 | cabab0bca0bb |
14 | 597994973365 |
15 | 29d82343585d |
hex | 14ed6f8a289d |
23010011130013 has 8 divisors (see below), whose sum is σ = 23336765922816. Its totient is φ = 22683330507600.
The previous prime is 23010011129893. The next prime is 23010011130017. The reversal of 23010011130013 is 31003111001032.
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 23010011130013 - 217 = 23010010998941 is a prime.
It is a super-2 number, since 2×230100111300132 (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 (23010011130017) 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, 17917581 + ... + 19158802.
It is an arithmetic number, because the mean of its divisors is an integer number (2917095740352).
Almost surely, 223010011130013 is an apocalyptic number.
It is an amenable number.
23010011130013 is a deficient number, since it is larger than the sum of its proper divisors (326754792803).
23010011130013 is an equidigital number, since it uses as much as digits as its factorization.
23010011130013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37085195.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 23010011130013 its reverse (31003111001032), we get a palindrome (54013122131045).
The spelling of 23010011130013 in words is "twenty-three trillion, ten billion, eleven million, one hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •