Base | Representation |
---|---|
bin | 11000011101010… |
… | …010001110100100 |
3 | 1001121002220222011 |
4 | 120131102032210 |
5 | 1320021030040 |
6 | 104414444004 |
7 | 13111514302 |
oct | 3035221644 |
9 | 1047086864 |
10 | 410330020 |
11 | 1a0691021 |
12 | b5503604 |
13 | 6701a439 |
14 | 3c6d3272 |
15 | 260543ea |
hex | 187523a4 |
410330020 has 48 divisors (see below), whose sum is σ = 920989440. Its totient is φ = 153019904.
The previous prime is 410329991. The next prime is 410330027. The reversal of 410330020 is 20033014.
It is not an unprimeable number, because it can be changed into a prime (410330027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30741 + ... + 42019.
It is an arithmetic number, because the mean of its divisors is an integer number (19187280).
Almost surely, 2410330020 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 410330020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (460494720).
410330020 is an abundant number, since it is smaller than the sum of its proper divisors (510659420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
410330020 is a wasteful number, since it uses less digits than its factorization.
410330020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11412 (or 11410 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 13.
The square root of 410330020 is about 20256.6043551233. The cubic root of 410330020 is about 743.0951562972.
Adding to 410330020 its reverse (20033014), we get a palindrome (430363034).
The spelling of 410330020 in words is "four hundred ten million, three hundred thirty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •