Base | Representation |
---|---|
bin | 10110001011011001… |
… | …101010001000000000 |
3 | 2021110121111000000000 |
4 | 112023121222020000 |
5 | 342232240030043 |
6 | 14535000000000 |
7 | 1502060136363 |
oct | 261331521000 |
9 | 67417430000 |
10 | 23813595648 |
11 | a110176967 |
12 | 4747160000 |
13 | 23267c23cb |
14 | 121c9960da |
15 | 9459702d3 |
hex | 58b66a200 |
23813595648 has 400 divisors, whose sum is σ = 76111691040. Its totient is φ = 7417184256.
The previous prime is 23813595599. The next prime is 23813595661. The reversal of 23813595648 is 84659531832.
23813595648 is a `hidden beast` number, since 2 + 3 + 8 + 1 + 3 + 595 + 6 + 48 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 23813595594 and 23813595603.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 171320763 + ... + 171320901.
Almost surely, 223813595648 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 23813595648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38055845520).
23813595648 is an abundant number, since it is smaller than the sum of its proper divisors (52298095392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23813595648 is an frugal number, since it uses more digits than its factorization.
23813595648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201 (or 161 counting only the distinct ones).
The product of its digits is 6220800, while the sum is 54.
The spelling of 23813595648 in words is "twenty-three billion, eight hundred thirteen million, five hundred ninety-five thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •