Base | Representation |
---|---|
bin | 101101000001… |
… | …1010101101000 |
3 | 1122102100012201 |
4 | 1122003111220 |
5 | 22020403012 |
6 | 2201545544 |
7 | 404440000 |
oct | 132032550 |
9 | 48370181 |
10 | 23606632 |
11 | 12364015 |
12 | 7aa52b4 |
13 | 4b76c2a |
14 | 31c7000 |
15 | 2114857 |
hex | 1683568 |
23606632 has 40 divisors (see below), whose sum is σ = 51678450. Its totient is φ = 10108896.
The previous prime is 23606621. The next prime is 23606641. The reversal of 23606632 is 23660632.
It can be written as a sum of positive squares in only one way, i.e., 13147876 + 10458756 = 3626^2 + 3234^2 .
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 23606632.
It is an unprimeable number.
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 9 ways as a sum of consecutive naturals, for example, 18594 + ... + 19822.
Almost surely, 223606632 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 23606632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25839225).
23606632 is an abundant number, since it is smaller than the sum of its proper divisors (28071818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23606632 is an equidigital number, since it uses as much as digits as its factorization.
23606632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1263 (or 1238 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 28.
The square root of 23606632 is about 4858.6656604463. The cubic root of 23606632 is about 286.8652947070.
The spelling of 23606632 in words is "twenty-three million, six hundred six thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •