Base | Representation |
---|---|
bin | 1010011101101011111001… |
… | …01101011110100101011101 |
3 | 10000110202102122020101020110 |
4 | 11032311330231132211131 |
5 | 11003444423404214323 |
6 | 120534431003040233 |
7 | 4563302000504610 |
oct | 516657455364535 |
9 | 100422378211213 |
10 | 23010232101213 |
11 | 7371648166905 |
12 | 26b7654210079 |
13 | cabb179178a6 |
14 | 5979b6054177 |
15 | 29d837a33793 |
hex | 14ed7cb5e95d |
23010232101213 has 16 divisors (see below), whose sum is σ = 35319146670720. Its totient is φ = 13052728114176.
The previous prime is 23010232101191. The next prime is 23010232101299. The reversal of 23010232101213 is 31210123201032.
It is not a de Polignac number, because 23010232101213 - 221 = 23010230004061 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 23010232101213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23010232101613) 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, 3998994708 + ... + 3999000461.
It is an arithmetic number, because the mean of its divisors is an integer number (2207446666920).
Almost surely, 223010232101213 is an apocalyptic number.
It is an amenable number.
23010232101213 is a deficient number, since it is larger than the sum of its proper divisors (12308914569507).
23010232101213 is a wasteful number, since it uses less digits than its factorization.
23010232101213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7997995316.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 23010232101213 its reverse (31210123201032), we get a palindrome (54220355302245).
The spelling of 23010232101213 in words is "twenty-three trillion, ten billion, two hundred thirty-two million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •