Base | Representation |
---|---|
bin | 110010000101100… |
… | …110011101000100 |
3 | 2011120020010201100 |
4 | 302011212131010 |
5 | 3210111012103 |
6 | 215215100100 |
7 | 26552451600 |
oct | 6205463504 |
9 | 2146203640 |
10 | 840329028 |
11 | 3a1386700 |
12 | 1b5511630 |
13 | 105133416 |
14 | 7d866500 |
15 | 4db915a3 |
hex | 32166744 |
840329028 has 324 divisors, whose sum is σ = 2825711616. Its totient is φ = 209563200.
The previous prime is 840328999. The next prime is 840329029. The reversal of 840329028 is 820923048.
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 = 840328983 and 840329001.
It is not an unprimeable number, because it can be changed into a prime (840329029) 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 107 ways as a sum of consecutive naturals, for example, 6616701 + ... + 6616827.
Almost surely, 2840329028 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 840329028, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1412855808).
840329028 is an abundant number, since it is smaller than the sum of its proper divisors (1985382588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
840329028 is a wasteful number, since it uses less digits than its factorization.
840329028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204 (or 181 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The square root of 840329028 is about 28988.4292089102. The cubic root of 840329028 is about 943.6619746972.
The spelling of 840329028 in words is "eight hundred forty million, three hundred twenty-nine thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •