Base | Representation |
---|---|
bin | 101101101101… |
… | …1000001110100 |
3 | 1200002120220200 |
4 | 1123123001310 |
5 | 22113401222 |
6 | 2213400500 |
7 | 410464113 |
oct | 133330164 |
9 | 50076820 |
10 | 23965812 |
11 | 12589962 |
12 | 8039130 |
13 | 4c71570 |
14 | 327bc7a |
15 | 2185eac |
hex | 16db074 |
23965812 has 72 divisors (see below), whose sum is σ = 66885000. Its totient is φ = 7188480.
The previous prime is 23965717. The next prime is 23965819. The reversal of 23965812 is 21856932.
It can be written as a sum of positive squares in 4 ways, for example, as 404496 + 23561316 = 636^2 + 4854^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23965819) 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 23 ways as a sum of consecutive naturals, for example, 18564 + ... + 19812.
Almost surely, 223965812 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 23965812, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33442500).
23965812 is an abundant number, since it is smaller than the sum of its proper divisors (42919188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23965812 is a wasteful number, since it uses less digits than its factorization.
23965812 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1313 (or 1308 counting only the distinct ones).
The product of its digits is 25920, while the sum is 36.
The square root of 23965812 is about 4895.4889439156. The cubic root of 23965812 is about 288.3128833399.
The spelling of 23965812 in words is "twenty-three million, nine hundred sixty-five thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •