Base | Representation |
---|---|
bin | 1001110101110… |
… | …11100000000000 |
3 | 12202100022211000 |
4 | 10322323200000 |
5 | 132113310203 |
6 | 12105252000 |
7 | 2021502516 |
oct | 472734000 |
9 | 182308730 |
10 | 82556928 |
11 | 42668273 |
12 | 23794000 |
13 | 1414716c |
14 | ad704b6 |
15 | 73ab4a3 |
hex | 4ebb800 |
82556928 has 96 divisors (see below), whose sum is σ = 244717200. Its totient is φ = 27500544.
The previous prime is 82556921. The next prime is 82556963. The reversal of 82556928 is 82965528.
82556928 is a `hidden beast` number, since 8 + 2 + 556 + 92 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (82556921) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 54550 + ... + 56042.
Almost surely, 282556928 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 82556928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122358600).
82556928 is an abundant number, since it is smaller than the sum of its proper divisors (162160272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
82556928 is a wasteful number, since it uses less digits than its factorization.
82556928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1524 (or 1498 counting only the distinct ones).
The product of its digits is 345600, while the sum is 45.
The square root of 82556928 is about 9086.0843051339. The cubic root of 82556928 is about 435.4294925713.
The spelling of 82556928 in words is "eighty-two million, five hundred fifty-six thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •