Base | Representation |
---|---|
bin | 1111001000001010000000 |
3 | 21110110201220 |
4 | 33020022000 |
5 | 2003344233 |
6 | 220555040 |
7 | 45464265 |
oct | 17101200 |
9 | 7413656 |
10 | 3965568 |
11 | 2269432 |
12 | 13b2a80 |
13 | a8acb9 |
14 | 75326c |
15 | 534eb3 |
hex | 3c8280 |
3965568 has 64 divisors (see below), whose sum is σ = 11016000. Its totient is φ = 1261568.
The previous prime is 3965537. The next prime is 3965569. The reversal of 3965568 is 8655693.
It is a tau number, because it is divible by the number of its divisors (64).
It is a d-powerful number, because it can be written as 310 + 9 + 62 + 59 + 59 + 63 + 8 .
It is not an unprimeable number, because it can be changed into a prime (3965569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8608 + ... + 9056.
It is an arithmetic number, because the mean of its divisors is an integer number (172125).
Almost surely, 23965568 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 3965568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5508000).
3965568 is an abundant number, since it is smaller than the sum of its proper divisors (7050432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3965568 is a wasteful number, since it uses less digits than its factorization.
3965568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489 (or 477 counting only the distinct ones).
The product of its digits is 194400, while the sum is 42.
The square root of 3965568 is about 1991.3733954234. The cubic root of 3965568 is about 158.2833137166.
The spelling of 3965568 in words is "three million, nine hundred sixty-five thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •