Base | Representation |
---|---|
bin | 101011111110… |
… | …0001101100000 |
3 | 1121101012222110 |
4 | 1113330031200 |
5 | 21400200102 |
6 | 2142035320 |
7 | 366643233 |
oct | 127741540 |
9 | 47335873 |
10 | 23053152 |
11 | 120161a1 |
12 | 7878b40 |
13 | 4a12025 |
14 | 30c141a |
15 | 205586c |
hex | 15fc360 |
23053152 has 48 divisors (see below), whose sum is σ = 62001072. Its totient is φ = 7495680.
The previous prime is 23053141. The next prime is 23053169. The reversal of 23053152 is 25135032.
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 1008 + ... + 6864.
It is an arithmetic number, because the mean of its divisors is an integer number (1291689).
Almost surely, 223053152 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 23053152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31000536).
23053152 is an abundant number, since it is smaller than the sum of its proper divisors (38947920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23053152 is a wasteful number, since it uses less digits than its factorization.
23053152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5911 (or 5903 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 21.
The square root of 23053152 is about 4801.3698045454. The cubic root of 23053152 is about 284.6055978804.
Adding to 23053152 its reverse (25135032), we get a palindrome (48188184).
The spelling of 23053152 in words is "twenty-three million, fifty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •