Base | Representation |
---|---|
bin | 10110010000001011… |
… | …001110000000000000 |
3 | 2021200012012112201200 |
4 | 112100023032000000 |
5 | 342413241242022 |
6 | 14550540501200 |
7 | 1504052032530 |
oct | 262013160000 |
9 | 67605175650 |
10 | 23893696512 |
11 | a151406924 |
12 | 4769b4a800 |
13 | 233a28967a |
14 | 12294874c0 |
15 | 94c9e3bac |
hex | 5902ce000 |
23893696512 has 336 divisors, whose sum is σ = 80175518592. Its totient is φ = 6715146240.
The previous prime is 23893696481. The next prime is 23893696517. The reversal of 23893696512 is 21569639832.
23893696512 is a `hidden beast` number, since 2 + 3 + 8 + 9 + 36 + 96 + 512 = 666.
It is a tau number, because it is divible by the number of its divisors (336).
It is a super-2 number, since 2×238936965122 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23893696517) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34578087 + ... + 34578777.
Almost surely, 223893696512 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 23893696512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40087759296).
23893696512 is an abundant number, since it is smaller than the sum of its proper divisors (56281822080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23893696512 is an equidigital number, since it uses as much as digits as its factorization.
23893696512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 797 (or 770 counting only the distinct ones).
The product of its digits is 4199040, while the sum is 54.
The spelling of 23893696512 in words is "twenty-three billion, eight hundred ninety-three million, six hundred ninety-six thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •