Base | Representation |
---|---|
bin | 10000100011110010011101… |
… | …111100111101110101100000 |
3 | 100112212022002120211111221010 |
4 | 100203302131330331311200 |
5 | 34021203440030211213 |
6 | 414520435133100520 |
7 | 21224441410366260 |
oct | 2043623574756540 |
9 | 315768076744833 |
10 | 72828115475808 |
11 | 21229259619820 |
12 | 82026b0627740 |
13 | 318387b037054 |
14 | 13dac846c97a0 |
15 | 86465e23bac3 |
hex | 423c9df3dd60 |
72828115475808 has 1536 divisors, whose sum is σ = 263235869245440. Its totient is φ = 17068863651840.
The previous prime is 72828115475737. The next prime is 72828115475867. The reversal of 72828115475808 is 80857451182827.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 88063017091 + ... + 88063017917.
It is an arithmetic number, because the mean of its divisors is an integer number (171377519040).
Almost surely, 272828115475808 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 72828115475808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (131617934622720).
72828115475808 is an abundant number, since it is smaller than the sum of its proper divisors (190407753769632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72828115475808 is a wasteful number, since it uses less digits than its factorization.
72828115475808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1300 (or 1292 counting only the distinct ones).
The product of its (nonzero) digits is 80281600, while the sum is 66.
The spelling of 72828115475808 in words is "seventy-two trillion, eight hundred twenty-eight billion, one hundred fifteen million, four hundred seventy-five thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •