Base | Representation |
---|---|
bin | 1100110001111… |
… | …1010001110000 |
3 | 10201212102220110 |
4 | 3030133101300 |
5 | 102210333423 |
6 | 5152541320 |
7 | 1220432136 |
oct | 314372160 |
9 | 121772813 |
10 | 53605488 |
11 | 28293662 |
12 | 15b51840 |
13 | b14b531 |
14 | 7195756 |
15 | 4a8d193 |
hex | 331f470 |
53605488 has 80 divisors (see below), whose sum is σ = 147847680. Its totient is φ = 16677888.
The previous prime is 53605463. The next prime is 53605493. The reversal of 53605488 is 88450635.
It is a happy number.
53605488 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 15 ways as a sum of consecutive naturals, for example, 145881 + ... + 146247.
It is an arithmetic number, because the mean of its divisors is an integer number (1848096).
Almost surely, 253605488 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 53605488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73923840).
53605488 is an abundant number, since it is smaller than the sum of its proper divisors (94242192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53605488 is a wasteful number, since it uses less digits than its factorization.
53605488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 574 (or 568 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 39.
The square root of 53605488 is about 7321.5768793341. The cubic root of 53605488 is about 377.0535939212.
The spelling of 53605488 in words is "fifty-three million, six hundred five thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •