Base | Representation |
---|---|
bin | 11000011000011… |
… | …100010110000100 |
3 | 1001111201102211210 |
4 | 120120130112010 |
5 | 1314204420430 |
6 | 104331331420 |
7 | 13064646624 |
oct | 3030342604 |
9 | 1044642753 |
10 | 409060740 |
11 | 19a9a4430 |
12 | b4bb0b70 |
13 | 6699479a |
14 | 3c482884 |
15 | 25da32b0 |
hex | 1861c584 |
409060740 has 96 divisors (see below), whose sum is σ = 1276176384. Its totient is φ = 97048960.
The previous prime is 409060733. The next prime is 409060753. The reversal of 409060740 is 47060904.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 409060698 and 409060707.
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 31 ways as a sum of consecutive naturals, for example, 24427 + ... + 37613.
It is an arithmetic number, because the mean of its divisors is an integer number (13293504).
Almost surely, 2409060740 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 409060740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (638088192).
409060740 is an abundant number, since it is smaller than the sum of its proper divisors (867115644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
409060740 is a wasteful number, since it uses less digits than its factorization.
409060740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13257 (or 13255 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 30.
The square root of 409060740 is about 20225.2500602588. The cubic root of 409060740 is about 742.3281557670.
The spelling of 409060740 in words is "four hundred nine million, sixty thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •