Base | Representation |
---|---|
bin | 1000100101101… |
… | …11111001010000 |
3 | 12000120211210120 |
4 | 10102313321100 |
5 | 121421301100 |
6 | 11052230240 |
7 | 1533316653 |
oct | 422677120 |
9 | 160524716 |
10 | 72056400 |
11 | 37746049 |
12 | 2016b380 |
13 | 11c0b830 |
14 | 97d989a |
15 | 64d50a0 |
hex | 44b7e50 |
72056400 has 240 divisors, whose sum is σ = 258316800. Its totient is φ = 17049600.
The previous prime is 72056381. The next prime is 72056473. The reversal of 72056400 is 465027.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 483526 + ... + 483674.
It is an arithmetic number, because the mean of its divisors is an integer number (1076320).
Almost surely, 272056400 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 72056400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129158400).
72056400 is an abundant number, since it is smaller than the sum of its proper divisors (186260400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72056400 is a wasteful number, since it uses less digits than its factorization.
72056400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214 (or 203 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 24.
The square root of 72056400 is about 8488.6041255321. The cubic root of 72056400 is about 416.1253628588.
The spelling of 72056400 in words is "seventy-two million, fifty-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •