Base | Representation |
---|---|
bin | 1001110010100… |
… | …00000000000001 |
3 | 12201111221210220 |
4 | 10321100000001 |
5 | 132010212414 |
6 | 12052013253 |
7 | 2014660011 |
oct | 471200001 |
9 | 181457726 |
10 | 82116609 |
11 | 42397473 |
12 | 23601229 |
13 | 14021913 |
14 | ac97c41 |
15 | 7320ca9 |
hex | 4e50001 |
82116609 has 4 divisors (see below), whose sum is σ = 109488816. Its totient is φ = 54744404.
The previous prime is 82116589. The next prime is 82116641. The reversal of 82116609 is 90661128.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 82116609 - 219 = 81592321 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 82116609.
It is not an unprimeable number, because it can be changed into a prime (82116649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13686099 + ... + 13686104.
It is an arithmetic number, because the mean of its divisors is an integer number (27372204).
It is a Proth number, since it is equal to 1253 ⋅ 216 + 1 and 1253 < 216.
Almost surely, 282116609 is an apocalyptic number.
It is an amenable number.
82116609 is a deficient number, since it is larger than the sum of its proper divisors (27372207).
82116609 is a wasteful number, since it uses less digits than its factorization.
82116609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27372206.
The product of its (nonzero) digits is 5184, while the sum is 33.
The square root of 82116609 is about 9061.8215056356. The cubic root of 82116609 is about 434.6539882881.
The spelling of 82116609 in words is "eighty-two million, one hundred sixteen thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •