Base | Representation |
---|---|
bin | 101101000111… |
… | …0011011101000 |
3 | 1122111122112200 |
4 | 1122032123220 |
5 | 22023331242 |
6 | 2202540200 |
7 | 405016323 |
oct | 132163350 |
9 | 48448480 |
10 | 23652072 |
11 | 12395174 |
12 | 7b07660 |
13 | 4b91812 |
14 | 31d97ba |
15 | 212304c |
hex | 168e6e8 |
23652072 has 48 divisors (see below), whose sum is σ = 65027040. Its totient is φ = 7764768.
The previous prime is 23652071. The next prime is 23652113. The reversal of 23652072 is 27025632.
23652072 is a `hidden beast` number, since 2 + 3 + 652 + 0 + 7 + 2 = 666.
It is a zygodrome in base 3.
It is not an unprimeable number, because it can be changed into a prime (23652071) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 2373 + ... + 7275.
It is an arithmetic number, because the mean of its divisors is an integer number (1354730).
Almost surely, 223652072 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 23652072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32513520).
23652072 is an abundant number, since it is smaller than the sum of its proper divisors (41374968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23652072 is a wasteful number, since it uses less digits than its factorization.
23652072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4982 (or 4975 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 27.
The square root of 23652072 is about 4863.3395933247. The cubic root of 23652072 is about 287.0492374256.
The spelling of 23652072 in words is "twenty-three million, six hundred fifty-two thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •