Base | Representation |
---|---|
bin | 1100101001101… |
… | …1100110110000 |
3 | 10200212001002100 |
4 | 3022123212300 |
5 | 102041104120 |
6 | 5133220400 |
7 | 1213024560 |
oct | 312334660 |
9 | 120761070 |
10 | 53066160 |
11 | 27a55434 |
12 | 15931700 |
13 | acbcbc4 |
14 | 7094da0 |
15 | 49d3490 |
hex | 329b9b0 |
53066160 has 120 divisors (see below), whose sum is σ = 203692320. Its totient is φ = 12128256.
The previous prime is 53066093. The next prime is 53066173. The reversal of 53066160 is 6166035.
53066160 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (120).
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 23 ways as a sum of consecutive naturals, for example, 225 + ... + 10304.
It is an arithmetic number, because the mean of its divisors is an integer number (1697436).
Almost surely, 253066160 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 53066160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101846160).
53066160 is an abundant number, since it is smaller than the sum of its proper divisors (150626160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53066160 is a wasteful number, since it uses less digits than its factorization.
53066160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10555 (or 10546 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The square root of 53066160 is about 7284.6523595845. The cubic root of 53066160 is about 375.7848097174.
The spelling of 53066160 in words is "fifty-three million, sixty-six thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •