Base | Representation |
---|---|
bin | 11000001111011… |
… | …011000011001100 |
3 | 1001100021022020000 |
4 | 120033123003030 |
5 | 1313103234030 |
6 | 104204524300 |
7 | 13035601014 |
oct | 3017330314 |
9 | 1040238200 |
10 | 406696140 |
11 | 199629914 |
12 | b4250690 |
13 | 66347406 |
14 | 3c028c44 |
15 | 25a87860 |
hex | 183db0cc |
406696140 has 240 divisors, whose sum is σ = 1368887520. Its totient is φ = 100776960.
The previous prime is 406696111. The next prime is 406696163. The reversal of 406696140 is 41696604.
It is a super-3 number, since 3×4066961403 (a number of 27 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 406696095 and 406696104.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 2246850 + ... + 2247030.
It is an arithmetic number, because the mean of its divisors is an integer number (5703698).
Almost surely, 2406696140 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 406696140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (684443760).
406696140 is an abundant number, since it is smaller than the sum of its proper divisors (962191380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
406696140 is a wasteful number, since it uses less digits than its factorization.
406696140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 294 (or 283 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 36.
The square root of 406696140 is about 20166.7087051903. The cubic root of 406696140 is about 740.8950334032.
The spelling of 406696140 in words is "four hundred six million, six hundred ninety-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •