Base | Representation |
---|---|
bin | 101101011011… |
… | …0111000000000 |
3 | 1122211001210002 |
4 | 1122312320000 |
5 | 22044131403 |
6 | 2210255132 |
7 | 406306304 |
oct | 132667000 |
9 | 48731702 |
10 | 23817728 |
11 | 12498680 |
12 | 7b874a8 |
13 | 4c1c03c |
14 | 323dd04 |
15 | 2157188 |
hex | 16b6e00 |
23817728 has 40 divisors (see below), whose sum is σ = 51927480. Its totient is φ = 10823680.
The previous prime is 23817727. The next prime is 23817737. The reversal of 23817728 is 82771832.
It is a junction number, because it is equal to n+sod(n) for n = 23817691 and 23817700.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23817721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3518 + ... + 7746.
It is an arithmetic number, because the mean of its divisors is an integer number (1298187).
Almost surely, 223817728 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 23817728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25963740).
23817728 is an abundant number, since it is smaller than the sum of its proper divisors (28109752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23817728 is an equidigital number, since it uses as much as digits as its factorization.
23817728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4258 (or 4242 counting only the distinct ones).
The product of its digits is 37632, while the sum is 38.
The square root of 23817728 is about 4880.3409716945. The cubic root of 23817728 is about 287.7178306294.
The spelling of 23817728 in words is "twenty-three million, eight hundred seventeen thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.202 sec. • engine limits •