Base | Representation |
---|---|
bin | 101101001111… |
… | …0001001010000 |
3 | 1122121220211101 |
4 | 1122132021100 |
5 | 22032411212 |
6 | 2204154144 |
7 | 405405055 |
oct | 132361120 |
9 | 48556741 |
10 | 23716432 |
11 | 12429563 |
12 | 7b38954 |
13 | 4bb4bbc |
14 | 321502c |
15 | 2137157 |
hex | 169e250 |
23716432 has 40 divisors (see below), whose sum is σ = 48211200. Its totient is φ = 11286912.
The previous prime is 23716423. The next prime is 23716439. The reversal of 23716432 is 23461732.
It is a self number, because there is not a number n which added to its sum of digits gives 23716432.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23716439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36333 + ... + 36979.
It is an arithmetic number, because the mean of its divisors is an integer number (1205280).
Almost surely, 223716432 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 23716432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24105600).
23716432 is an abundant number, since it is smaller than the sum of its proper divisors (24494768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23716432 is a wasteful number, since it uses less digits than its factorization.
23716432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 763 (or 757 counting only the distinct ones).
The product of its digits is 6048, while the sum is 28.
The square root of 23716432 is about 4869.9519504816. The cubic root of 23716432 is about 287.3093662513.
The spelling of 23716432 in words is "twenty-three million, seven hundred sixteen thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •