Base | Representation |
---|---|
bin | 1111011011100010100000 |
3 | 21121111122100 |
4 | 33123202200 |
5 | 2013414320 |
6 | 222410400 |
7 | 46244613 |
oct | 17334240 |
9 | 7544570 |
10 | 4044960 |
11 | 2313047 |
12 | 1430a00 |
13 | ab818a |
14 | 77417a |
15 | 54d790 |
hex | 3db8a0 |
4044960 has 108 divisors (see below), whose sum is σ = 14068782. Its totient is φ = 1058304.
The previous prime is 4044959. The next prime is 4044977. The reversal of 4044960 is 694404.
4044960 is digitally balanced in base 2 and base 5, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 3825936 + 219024 = 1956^2 + 468^2 .
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 17 ways as a sum of consecutive naturals, for example, 76294 + ... + 76346.
Almost surely, 24044960 is an apocalyptic number.
4044960 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4044960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7034391).
4044960 is an abundant number, since it is smaller than the sum of its proper divisors (10023822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4044960 is a wasteful number, since it uses less digits than its factorization.
4044960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127 (or 63 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 4044960 is about 2011.2085918671. The cubic root of 4044960 is about 159.3326369528.
The spelling of 4044960 in words is "four million, forty-four thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •