Base | Representation |
---|---|
bin | 101011111001… |
… | …0001110011000 |
3 | 1121022010212111 |
4 | 1113302032120 |
5 | 21342342443 |
6 | 2141122104 |
7 | 366413050 |
oct | 127621630 |
9 | 47263774 |
10 | 23012248 |
11 | 11a98496 |
12 | 7859334 |
13 | 49c951c |
14 | 30b0560 |
15 | 204869d |
hex | 15f2398 |
23012248 has 32 divisors (see below), whose sum is σ = 49916160. Its totient is φ = 9741600.
The previous prime is 23012243. The next prime is 23012251. The reversal of 23012248 is 84221032.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23012243) 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 7 ways as a sum of consecutive naturals, for example, 2173 + ... + 7123.
It is an arithmetic number, because the mean of its divisors is an integer number (1559880).
Almost surely, 223012248 is an apocalyptic number.
23012248 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23012248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24958080).
23012248 is an abundant number, since it is smaller than the sum of its proper divisors (26903912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23012248 is a wasteful number, since it uses less digits than its factorization.
23012248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5047 (or 5043 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 23012248 is about 4797.1082956298. The cubic root of 23012248 is about 284.4371697268.
The spelling of 23012248 in words is "twenty-three million, twelve thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •