Base | Representation |
---|---|
bin | 100110010101100101… |
… | …0010111111010000000 |
3 | 21212111121122001120110 |
4 | 1030223022113322000 |
5 | 2322102100041042 |
6 | 101453213511320 |
7 | 5643114600420 |
oct | 1145312277200 |
9 | 255447561513 |
10 | 82328518272 |
11 | 31a08336350 |
12 | 13b577a2540 |
13 | 79c0683690 |
14 | 3db010c480 |
15 | 221cb2509c |
hex | 132b297e80 |
82328518272 has 1024 divisors, whose sum is σ = 319206666240. Its totient is φ = 18084003840.
The previous prime is 82328518241. The next prime is 82328518273. The reversal of 82328518272 is 27281582328.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (82328518273) 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 127 ways as a sum of consecutive naturals, for example, 280984558 + ... + 280984850.
It is an arithmetic number, because the mean of its divisors is an integer number (311725260).
Almost surely, 282328518272 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 82328518272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159603333120).
82328518272 is an abundant number, since it is smaller than the sum of its proper divisors (236878147968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
82328518272 is a wasteful number, since it uses less digits than its factorization.
82328518272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401 (or 389 counting only the distinct ones).
The product of its digits is 860160, while the sum is 48.
The spelling of 82328518272 in words is "eighty-two billion, three hundred twenty-eight million, five hundred eighteen thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •