Base | Representation |
---|---|
bin | 11000000101001… |
… | …011111111010100 |
3 | 1001011012222122220 |
4 | 120011023333110 |
5 | 1311411404022 |
6 | 104031222340 |
7 | 13004024334 |
oct | 3005137724 |
9 | 1034188586 |
10 | 404013012 |
11 | 198066a57 |
12 | b33779b0 |
13 | 65918070 |
14 | 3b92b0c4 |
15 | 2570785c |
hex | 1814bfd4 |
404013012 has 48 divisors (see below), whose sum is σ = 1018792320. Its totient is φ = 123873408.
The previous prime is 404012989. The next prime is 404013019. The reversal of 404013012 is 210310404.
It is a junction number, because it is equal to n+sod(n) for n = 404012982 and 404013000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404013019) 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, 41289 + ... + 50127.
It is an arithmetic number, because the mean of its divisors is an integer number (21224840).
Almost surely, 2404013012 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 404013012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (509396160).
404013012 is an abundant number, since it is smaller than the sum of its proper divisors (614779308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
404013012 is a wasteful number, since it uses less digits than its factorization.
404013012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9152 (or 9150 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 404013012 is about 20100.0749252335. The cubic root of 404013012 is about 739.2621156995.
Adding to 404013012 its reverse (210310404), we get a palindrome (614323416).
The spelling of 404013012 in words is "four hundred four million, thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •