Base | Representation |
---|---|
bin | 101101001110… |
… | …101111100000 |
3 | 211022101120010 |
4 | 231032233200 |
5 | 11013404424 |
6 | 1102044520 |
7 | 202532055 |
oct | 55165740 |
9 | 24271503 |
10 | 11856864 |
11 | 6769268 |
12 | 3b79740 |
13 | 25c1ac6 |
14 | 180902c |
15 | 1093229 |
hex | b4ebe0 |
11856864 has 48 divisors (see below), whose sum is σ = 31428432. Its totient is φ = 3913728.
The previous prime is 11856857. The next prime is 11856877. The reversal of 11856864 is 46865811.
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 10302 + ... + 11394.
It is an arithmetic number, because the mean of its divisors is an integer number (654759).
Almost surely, 211856864 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 11856864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15714216).
11856864 is an abundant number, since it is smaller than the sum of its proper divisors (19571568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11856864 is a wasteful number, since it uses less digits than its factorization.
11856864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1219 (or 1211 counting only the distinct ones).
The product of its digits is 46080, while the sum is 39.
The square root of 11856864 is about 3443.3797350859. The cubic root of 11856864 is about 228.0289283085.
It can be divided in two parts, 11856 and 864, that added together give a triangular number (12720 = T159).
The spelling of 11856864 in words is "eleven million, eight hundred fifty-six thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •