Base | Representation |
---|---|
bin | 1001110111001… |
… | …11011111010100 |
3 | 12202200110222100 |
4 | 10323213133110 |
5 | 132140041413 |
6 | 12113202100 |
7 | 2023153026 |
oct | 473473724 |
9 | 182613870 |
10 | 82737108 |
11 | 42780683 |
12 | 23860330 |
13 | 141ab18c |
14 | adba016 |
15 | 73e4a73 |
hex | 4ee77d4 |
82737108 has 72 divisors (see below), whose sum is σ = 216058752. Its totient is φ = 26681472.
The previous prime is 82737103. The next prime is 82737157. The reversal of 82737108 is 80173728.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (82737103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 180816 + ... + 181272.
It is an arithmetic number, because the mean of its divisors is an integer number (3000816).
Almost surely, 282737108 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 82737108, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (108029376).
82737108 is an abundant number, since it is smaller than the sum of its proper divisors (133321644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
82737108 is a wasteful number, since it uses less digits than its factorization.
82737108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 621 (or 616 counting only the distinct ones).
The product of its (nonzero) digits is 18816, while the sum is 36.
The square root of 82737108 is about 9095.9940633226. The cubic root of 82737108 is about 435.7460364828.
The spelling of 82737108 in words is "eighty-two million, seven hundred thirty-seven thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •