Base | Representation |
---|---|
bin | 1010110001010110000101… |
… | …01000100101000110001000 |
3 | 10002212022222012122110010210 |
4 | 11120223002220211012020 |
5 | 11101031321030302002 |
6 | 122213022311441120 |
7 | 4663144046244024 |
oct | 530530250450610 |
9 | 102768865573123 |
10 | 23685715087752 |
11 | 7602067755403 |
12 | 27a654a0861a0 |
13 | 102a726927473 |
14 | 5bc5751b9384 |
15 | 2b11be52096c |
hex | 158ac2a25188 |
23685715087752 has 16 divisors (see below), whose sum is σ = 59214287719440. Its totient is φ = 7895238362576.
The previous prime is 23685715087729. The next prime is 23685715087753. The reversal of 23685715087752 is 25778051758632.
It is a happy number.
It is a super-2 number, since 2×236857150877522 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (23685715087753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 493452397638 + ... + 493452397685.
It is an arithmetic number, because the mean of its divisors is an integer number (3700892982465).
Almost surely, 223685715087752 is an apocalyptic number.
It is an amenable number.
23685715087752 is an abundant number, since it is smaller than the sum of its proper divisors (35528572631688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23685715087752 is a wasteful number, since it uses less digits than its factorization.
23685715087752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 986904795332 (or 986904795328 counting only the distinct ones).
The product of its (nonzero) digits is 197568000, while the sum is 66.
The spelling of 23685715087752 in words is "twenty-three trillion, six hundred eighty-five billion, seven hundred fifteen million, eighty-seven thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •