Base | Representation |
---|---|
bin | 111101001101011001000 |
3 | 10202220022100 |
4 | 13221223020 |
5 | 1003140304 |
6 | 110553400 |
7 | 23022351 |
oct | 7515310 |
9 | 3686270 |
10 | 2005704 |
11 | 114aa08 |
12 | 808860 |
13 | 552c0c |
14 | 3a2d28 |
15 | 299439 |
hex | 1e9ac8 |
2005704 has 48 divisors (see below), whose sum is σ = 5510700. Its totient is φ = 658944.
The previous prime is 2005693. The next prime is 2005723. The reversal of 2005704 is 4075002.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1512900 + 492804 = 1230^2 + 702^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
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 11 ways as a sum of consecutive naturals, for example, 6252 + ... + 6564.
22005704 is an apocalyptic number.
2005704 is a gapful number since it is divisible by the number (24) 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 2005704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2755350).
2005704 is an abundant number, since it is smaller than the sum of its proper divisors (3504996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2005704 is a wasteful number, since it uses less digits than its factorization.
2005704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 414 (or 407 counting only the distinct ones).
The product of its (nonzero) digits is 280, while the sum is 18.
The square root of 2005704 is about 1416.2287950751. The cubic root of 2005704 is about 126.1117677965. Note that the first 3 decimals are identical.
The spelling of 2005704 in words is "two million, five thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.073 sec. • engine limits •