Base | Representation |
---|---|
bin | 101100010000… |
… | …1101001100000 |
3 | 1121200000022212 |
4 | 1120201221200 |
5 | 21420101441 |
6 | 2145221252 |
7 | 401152265 |
oct | 130415140 |
9 | 47600285 |
10 | 23206496 |
11 | 12110425 |
12 | 7931828 |
13 | 4a66a71 |
14 | 312126c |
15 | 2085eeb |
hex | 1621a60 |
23206496 has 48 divisors (see below), whose sum is σ = 50077440. Its totient is φ = 10536960.
The previous prime is 23206493. The next prime is 23206499. The reversal of 23206496 is 69460232.
It is an interprime number because it is at equal distance from previous prime (23206493) and next prime (23206499).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23206493) 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, 15041 + ... + 16511.
It is an arithmetic number, because the mean of its divisors is an integer number (1043280).
Almost surely, 223206496 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 23206496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25038720).
23206496 is an abundant number, since it is smaller than the sum of its proper divisors (26870944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23206496 is a wasteful number, since it uses less digits than its factorization.
23206496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1527 (or 1519 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 32.
The square root of 23206496 is about 4817.3121136169. The cubic root of 23206496 is about 285.2352464165.
The spelling of 23206496 in words is "twenty-three million, two hundred six thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •