Base | Representation |
---|---|
bin | 101101101001… |
… | …011001110000 |
3 | 211111221100120 |
4 | 231221121300 |
5 | 11030403224 |
6 | 1104250240 |
7 | 203465325 |
oct | 55513160 |
9 | 24457316 |
10 | 11966064 |
11 | 6833310 |
12 | 4010980 |
13 | 262c716 |
14 | 1836b4c |
15 | 10b5779 |
hex | b69670 |
11966064 has 80 divisors (see below), whose sum is σ = 34176384. Its totient is φ = 3577600.
The previous prime is 11966063. The next prime is 11966099. The reversal of 11966064 is 46066911.
11966064 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11966063) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 69082 + ... + 69254.
Almost surely, 211966064 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 11966064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17088192).
11966064 is an abundant number, since it is smaller than the sum of its proper divisors (22210320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11966064 is a wasteful number, since it uses less digits than its factorization.
11966064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 326 (or 320 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 33.
The square root of 11966064 is about 3459.1999074931. The cubic root of 11966064 is about 228.7268279553.
It can be divided in two parts, 1196 and 6064, that added together give a triangular number (7260 = T120).
The spelling of 11966064 in words is "eleven million, nine hundred sixty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •