Base | Representation |
---|---|
bin | 101101001111… |
… | …0000000000000 |
3 | 1122121220000110 |
4 | 1122132000000 |
5 | 22032401330 |
6 | 2204151320 |
7 | 405403251 |
oct | 132360000 |
9 | 48556013 |
10 | 23715840 |
11 | 12429075 |
12 | 7b38540 |
13 | 4bb4855 |
14 | 3214b28 |
15 | 2136db0 |
hex | 169e000 |
23715840 has 112 divisors (see below), whose sum is σ = 76279248. Its totient is φ = 6291456.
The previous prime is 23715803. The next prime is 23715841. The reversal of 23715840 is 4851732.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 23715798 and 23715807.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23715841) 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, 122784 + ... + 122976.
Almost surely, 223715840 is an apocalyptic number.
23715840 is a gapful number since it is divisible by the number (20) 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 23715840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (38139624).
23715840 is an abundant number, since it is smaller than the sum of its proper divisors (52563408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23715840 is an equidigital number, since it uses as much as digits as its factorization.
23715840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227 (or 203 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 23715840 is about 4869.8911692152. The cubic root of 23715840 is about 287.3069756646.
The spelling of 23715840 in words is "twenty-three million, seven hundred fifteen thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •