Base | Representation |
---|---|
bin | 110001100110001… |
… | …111011001010100 |
3 | 2010222202110202010 |
4 | 301212033121110 |
5 | 3201004424431 |
6 | 214322544220 |
7 | 26422542120 |
oct | 6146173124 |
9 | 2128673663 |
10 | 832108116 |
11 | 397781164 |
12 | 1b2808070 |
13 | 103515588 |
14 | 7c726580 |
15 | 4d0ba846 |
hex | 3198f654 |
832108116 has 96 divisors (see below), whose sum is σ = 2385653760. Its totient is φ = 220420224.
The previous prime is 832108111. The next prime is 832108127. The reversal of 832108116 is 611801238.
832108116 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (832108111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 69466 + ... + 80558.
It is an arithmetic number, because the mean of its divisors is an integer number (24850560).
Almost surely, 2832108116 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 832108116, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1192826880).
832108116 is an abundant number, since it is smaller than the sum of its proper divisors (1553545644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
832108116 is a wasteful number, since it uses less digits than its factorization.
832108116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11173 (or 11171 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 30.
The square root of 832108116 is about 28846.2842667821. The cubic root of 832108116 is about 940.5746132117.
The spelling of 832108116 in words is "eight hundred thirty-two million, one hundred eight thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •