Base | Representation |
---|---|
bin | 1001110101100… |
… | …01100010100011 |
3 | 12202021020212000 |
4 | 10322301202203 |
5 | 132111004011 |
6 | 12104335043 |
7 | 2021242545 |
oct | 472614243 |
9 | 182236760 |
10 | 82516131 |
11 | 4263a655 |
12 | 23774483 |
13 | 14131719 |
14 | ad5d695 |
15 | 739e356 |
hex | 4eb18a3 |
82516131 has 16 divisors (see below), whose sum is σ = 122389920. Its totient is φ = 54946080.
The previous prime is 82516127. The next prime is 82516169. The reversal of 82516131 is 13161528.
It is not a de Polignac number, because 82516131 - 22 = 82516127 is a prime.
It is a super-2 number, since 2×825161312 = 13617823750418322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 82516095 and 82516104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (82516121) 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 15 ways as a sum of consecutive naturals, for example, 36181 + ... + 38393.
It is an arithmetic number, because the mean of its divisors is an integer number (7649370).
Almost surely, 282516131 is an apocalyptic number.
82516131 is a deficient number, since it is larger than the sum of its proper divisors (39873789).
82516131 is a wasteful number, since it uses less digits than its factorization.
82516131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3603 (or 3597 counting only the distinct ones).
The product of its digits is 1440, while the sum is 27.
The square root of 82516131 is about 9083.8390012153. The cubic root of 82516131 is about 435.3577556321.
Adding to 82516131 its reverse (13161528), we get a palindrome (95677659).
The spelling of 82516131 in words is "eighty-two million, five hundred sixteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •