Base | Representation |
---|---|
bin | 1100101001110… |
… | …0101110101000 |
3 | 10200212021101201 |
4 | 3022130232220 |
5 | 102041231020 |
6 | 5133253544 |
7 | 1213044151 |
oct | 312345650 |
9 | 120767351 |
10 | 53070760 |
11 | 27a58936 |
12 | 159342b4 |
13 | acc2022 |
14 | 7096928 |
15 | 49d4a0a |
hex | 329cba8 |
53070760 has 64 divisors (see below), whose sum is σ = 124600320. Its totient is φ = 20321280.
The previous prime is 53070751. The next prime is 53070779. The reversal of 53070760 is 6707035.
53070760 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 157312 + ... + 157648.
It is an arithmetic number, because the mean of its divisors is an integer number (1946880).
Almost surely, 253070760 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 53070760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62300160).
53070760 is an abundant number, since it is smaller than the sum of its proper divisors (71529560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53070760 is a wasteful number, since it uses less digits than its factorization.
53070760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506 (or 502 counting only the distinct ones).
The product of its (nonzero) digits is 4410, while the sum is 28.
The square root of 53070760 is about 7284.9680850365. The cubic root of 53070760 is about 375.7956676112.
Adding to 53070760 its reverse (6707035), we get a palindrome (59777795).
The spelling of 53070760 in words is "fifty-three million, seventy thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •