Base | Representation |
---|---|
bin | 1000101011001… |
… | …00111111100000 |
3 | 12001220212101010 |
4 | 10111210333200 |
5 | 122111443113 |
6 | 11115340520 |
7 | 1542332022 |
oct | 425447740 |
9 | 161825333 |
10 | 72765408 |
11 | 3808a801 |
12 | 20451740 |
13 | 120c9471 |
14 | 9942012 |
15 | 65c51c3 |
hex | 4564fe0 |
72765408 has 96 divisors (see below), whose sum is σ = 201398400. Its totient is φ = 22969856.
The previous prime is 72765337. The next prime is 72765409. The reversal of 72765408 is 80456727.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72765409) 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 15 ways as a sum of consecutive naturals, for example, 164035 + ... + 164477.
It is an arithmetic number, because the mean of its divisors is an integer number (2097900).
Almost surely, 272765408 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 72765408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100699200).
72765408 is an abundant number, since it is smaller than the sum of its proper divisors (128632992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72765408 is a wasteful number, since it uses less digits than its factorization.
72765408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 544 (or 536 counting only the distinct ones).
The product of its (nonzero) digits is 94080, while the sum is 39.
The square root of 72765408 is about 8530.2642397525. The cubic root of 72765408 is about 417.4857499290.
The spelling of 72765408 in words is "seventy-two million, seven hundred sixty-five thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •