Base | Representation |
---|---|
bin | 1001110110010… |
… | …11001000101100 |
3 | 12202110120200000 |
4 | 10323023020230 |
5 | 132122332342 |
6 | 12110504300 |
7 | 2022160320 |
oct | 473131054 |
9 | 182416600 |
10 | 82620972 |
11 | 427013a5 |
12 | 23805090 |
13 | 1416a365 |
14 | ad89980 |
15 | 73c044c |
hex | 4ecb22c |
82620972 has 72 divisors (see below), whose sum is σ = 247543296. Its totient is φ = 23604048.
The previous prime is 82620959. The next prime is 82620977. The reversal of 82620972 is 27902628.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (82620977) 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, 733 + ... + 12875.
Almost surely, 282620972 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 82620972, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123771648).
82620972 is an abundant number, since it is smaller than the sum of its proper divisors (164922324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
82620972 is a wasteful number, since it uses less digits than its factorization.
82620972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12169 (or 12155 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 82620972 is about 9089.6079123359. The cubic root of 82620972 is about 435.5420590921.
It can be divided in two parts, 826209 and 72, that added together give a square (826281 = 9092).
The spelling of 82620972 in words is "eighty-two million, six hundred twenty thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •