Base | Representation |
---|---|
bin | 101100110100… |
… | …1111101010000 |
3 | 1122020001121100 |
4 | 1121221331100 |
5 | 22004041142 |
6 | 2155424400 |
7 | 403524624 |
oct | 131517520 |
9 | 48201540 |
10 | 23502672 |
11 | 122a29a6 |
12 | 7a55100 |
13 | 4b3b80b |
14 | 319b184 |
15 | 20e3b4c |
hex | 1669f50 |
23502672 has 60 divisors (see below), whose sum is σ = 66156480. Its totient is φ = 7788864.
The previous prime is 23502671. The next prime is 23502683. The reversal of 23502672 is 27620532.
It is a super-2 number, since 2×235026722 = 1104751182279168, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23502671) 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, 32329 + ... + 33047.
It is an arithmetic number, because the mean of its divisors is an integer number (1102608).
Almost surely, 223502672 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 23502672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33078240).
23502672 is an abundant number, since it is smaller than the sum of its proper divisors (42653808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23502672 is a wasteful number, since it uses less digits than its factorization.
23502672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 960 (or 951 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 27.
The square root of 23502672 is about 4847.9554453398. The cubic root of 23502672 is about 286.4435713908.
The spelling of 23502672 in words is "twenty-three million, five hundred two thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •