Base | Representation |
---|---|
bin | 1111010001110011010000 |
3 | 21112110221000 |
4 | 33101303100 |
5 | 2011130242 |
6 | 221502000 |
7 | 46020411 |
oct | 17216320 |
9 | 7473830 |
10 | 4005072 |
11 | 2296085 |
12 | 1411900 |
13 | aa2c86 |
14 | 763808 |
15 | 541a4c |
hex | 3d1cd0 |
4005072 has 80 divisors (see below), whose sum is σ = 11745280. Its totient is φ = 1306368.
The previous prime is 4005049. The next prime is 4005091. The reversal of 4005072 is 2705004.
It is a happy number.
4005072 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 (18).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 31473 + ... + 31599.
It is an arithmetic number, because the mean of its divisors is an integer number (146816).
Almost surely, 24005072 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 4005072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5872640).
4005072 is an abundant number, since it is smaller than the sum of its proper divisors (7740208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4005072 is a wasteful number, since it uses less digits than its factorization.
4005072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217 (or 205 counting only the distinct ones).
The product of its (nonzero) digits is 280, while the sum is 18.
The square root of 4005072 is about 2001.2675982986. The cubic root of 4005072 is about 158.8071710094.
The spelling of 4005072 in words is "four million, five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •