Base | Representation |
---|---|
bin | 1001110010011… |
… | …01010100001110 |
3 | 12201111101201200 |
4 | 10321031110032 |
5 | 132004334424 |
6 | 12051450330 |
7 | 2014612653 |
oct | 471152416 |
9 | 181441650 |
10 | 82105614 |
11 | 4238a188 |
12 | 235b69a6 |
13 | 14019906 |
14 | ac93c2a |
15 | 731c8c9 |
hex | 4e4d50e |
82105614 has 48 divisors (see below), whose sum is σ = 189287280. Its totient is φ = 25632000.
The previous prime is 82105613. The next prime is 82105633. The reversal of 82105614 is 41650128.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (82105613) 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 23 ways as a sum of consecutive naturals, for example, 76272 + ... + 77340.
It is an arithmetic number, because the mean of its divisors is an integer number (3943485).
Almost surely, 282105614 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 82105614, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94643640).
82105614 is an abundant number, since it is smaller than the sum of its proper divisors (107181666).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
82105614 is a wasteful number, since it uses less digits than its factorization.
82105614 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1345 (or 1342 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The square root of 82105614 is about 9061.2148192171. The cubic root of 82105614 is about 434.6345880963.
It can be divided in two parts, 8210 and 5614, that added together give a cube (13824 = 243).
The spelling of 82105614 in words is "eighty-two million, one hundred five thousand, six hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •