Base | Representation |
---|---|
bin | 1001110010011… |
… | …01110010000000 |
3 | 12201111111100021 |
4 | 10321031302000 |
5 | 132004420040 |
6 | 12051503224 |
7 | 2014621345 |
oct | 471156200 |
9 | 181444307 |
10 | 82107520 |
11 | 42390660 |
12 | 235b7b14 |
13 | 1401a741 |
14 | ac947cc |
15 | 731d24a |
hex | 4e4dc80 |
82107520 has 128 divisors (see below), whose sum is σ = 218116800. Its totient is φ = 29306880.
The previous prime is 82107503. The next prime is 82107563. The reversal of 82107520 is 2570128.
It is a tau number, because it is divible by the number of its divisors (128).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 753226 + ... + 753334.
Almost surely, 282107520 is an apocalyptic number.
82107520 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 82107520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (109058400).
82107520 is an abundant number, since it is smaller than the sum of its proper divisors (136009280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
82107520 is a wasteful number, since it uses less digits than its factorization.
82107520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246 (or 234 counting only the distinct ones).
The product of its (nonzero) digits is 1120, while the sum is 25.
The square root of 82107520 is about 9061.3199921424. The cubic root of 82107520 is about 434.6379512732.
Adding to 82107520 its reverse (2570128), we get a palindrome (84677648).
The spelling of 82107520 in words is "eighty-two million, one hundred seven thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •