Base | Representation |
---|---|
bin | 1010101001011000111000… |
… | …01110010000011101111101 |
3 | 10001220012100020121210021201 |
4 | 11110230130032100131331 |
5 | 11032041433044330023 |
6 | 121443251451455501 |
7 | 4634325421300000 |
oct | 524543416203575 |
9 | 101805306553251 |
10 | 23412340230013 |
11 | 7507132779609 |
12 | 2761575457591 |
13 | 100aa0ac2ba07 |
14 | 5ad2401bb537 |
15 | 2a901e54cbad |
hex | 154b1c39077d |
23412340230013 has 48 divisors (see below), whose sum is σ = 28270546162560. Its totient is φ = 19365778353600.
The previous prime is 23412340230011. The next prime is 23412340230061. The reversal of 23412340230013 is 31003204321432.
It is a happy number.
It is not a de Polignac number, because 23412340230013 - 21 = 23412340230011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23412340230011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1038644523 + ... + 1038667063.
It is an arithmetic number, because the mean of its divisors is an integer number (588969711720).
Almost surely, 223412340230013 is an apocalyptic number.
It is an amenable number.
23412340230013 is a deficient number, since it is larger than the sum of its proper divisors (4858205932547).
23412340230013 is an frugal number, since it uses more digits than its factorization.
23412340230013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24736 (or 24708 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 23412340230013 its reverse (31003204321432), we get a palindrome (54415544551445).
The spelling of 23412340230013 in words is "twenty-three trillion, four hundred twelve billion, three hundred forty million, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •