Base | Representation |
---|---|
bin | 1010100100011100011001… |
… | …10101001111010011100000 |
3 | 10001021221202222001200222120 |
4 | 11102032030311033103200 |
5 | 11021300444241231331 |
6 | 121233231511104240 |
7 | 4616132050101330 |
oct | 522161465172340 |
9 | 101257688050876 |
10 | 23242430805216 |
11 | 7451072295987 |
12 | 2734657072080 |
13 | cc79a099862c |
14 | 5a4d225a10c0 |
15 | 2a48c7b44796 |
hex | 15238cd4f4e0 |
23242430805216 has 768 divisors, whose sum is σ = 74509043761152. Its totient is φ = 6201702144000.
The previous prime is 23242430805137. The next prime is 23242430805227. The reversal of 23242430805216 is 61250803424232.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 40704782211 + ... + 40704782781.
It is an arithmetic number, because the mean of its divisors is an integer number (97016984064).
Almost surely, 223242430805216 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23242430805216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37254521880576).
23242430805216 is an abundant number, since it is smaller than the sum of its proper divisors (51266612955936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23242430805216 is a wasteful number, since it uses less digits than its factorization.
23242430805216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1035 (or 1027 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 42.
The spelling of 23242430805216 in words is "twenty-three trillion, two hundred forty-two billion, four hundred thirty million, eight hundred five thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •