Base | Representation |
---|---|
bin | 101100000011… |
… | …0111000000000 |
3 | 1121110102220020 |
4 | 1120012320000 |
5 | 21403044312 |
6 | 2143013440 |
7 | 400214463 |
oct | 130067000 |
9 | 47412806 |
10 | 23096832 |
11 | 12045aa0 |
12 | 789a280 |
13 | 4a28b85 |
14 | 30d32da |
15 | 206378c |
hex | 1606e00 |
23096832 has 80 divisors (see below), whose sum is σ = 67174272. Its totient is φ = 6993920.
The previous prime is 23096819. The next prime is 23096839. The reversal of 23096832 is 23869032.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 23096793 and 23096802.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23096839) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16213 + ... + 17579.
Almost surely, 223096832 is an apocalyptic number.
23096832 is a gapful number since it is divisible by the number (22) 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 23096832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33587136).
23096832 is an abundant number, since it is smaller than the sum of its proper divisors (44077440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23096832 is a wasteful number, since it uses less digits than its factorization.
23096832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1399 (or 1383 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 33.
The square root of 23096832 is about 4805.9163538289. The cubic root of 23096832 is about 284.7852367889.
The spelling of 23096832 in words is "twenty-three million, ninety-six thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •