Base | Representation |
---|---|
bin | 110010001000000… |
… | …001111111110000 |
3 | 2011121102111122122 |
4 | 302020001333300 |
5 | 3210241404003 |
6 | 215240453412 |
7 | 26561044202 |
oct | 6210017760 |
9 | 2147374578 |
10 | 840966128 |
11 | 3a1781332 |
12 | 1b577a268 |
13 | 1052c73c2 |
14 | 7d990772 |
15 | 4dc6a238 |
hex | 32201ff0 |
840966128 has 40 divisors (see below), whose sum is σ = 1689601680. Its totient is φ = 405009920.
The previous prime is 840966121. The next prime is 840966199. The reversal of 840966128 is 821669048.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (840966121) 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 7 ways as a sum of consecutive naturals, for example, 214748 + ... + 218628.
It is an arithmetic number, because the mean of its divisors is an integer number (42240042).
Almost surely, 2840966128 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 840966128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (844800840).
840966128 is an abundant number, since it is smaller than the sum of its proper divisors (848635552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
840966128 is a wasteful number, since it uses less digits than its factorization.
840966128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4385 (or 4379 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 44.
The square root of 840966128 is about 28999.4159941196. The cubic root of 840966128 is about 943.9003952649.
The spelling of 840966128 in words is "eight hundred forty million, nine hundred sixty-six thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •