Base | Representation |
---|---|
bin | 1100101001011… |
… | …1101011100000 |
3 | 10200211020000210 |
4 | 3022113223200 |
5 | 102040100310 |
6 | 5133014120 |
7 | 1212626646 |
oct | 312275340 |
9 | 120736023 |
10 | 53050080 |
11 | 27a44346 |
12 | 15924340 |
13 | acb57a5 |
14 | 708d196 |
15 | 49cd820 |
hex | 3297ae0 |
53050080 has 96 divisors (see below), whose sum is σ = 169344000. Its totient is φ = 13957632.
The previous prime is 53050073. The next prime is 53050093. The reversal of 53050080 is 8005035.
53050080 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 (96).
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, 37221 + ... + 38619.
It is an arithmetic number, because the mean of its divisors is an integer number (1764000).
Almost surely, 253050080 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 53050080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84672000).
53050080 is an abundant number, since it is smaller than the sum of its proper divisors (116293920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53050080 is a wasteful number, since it uses less digits than its factorization.
53050080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1496 (or 1488 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 53050080 is about 7283.5485856827. The cubic root of 53050080 is about 375.7468493664.
The spelling of 53050080 in words is "fifty-three million, fifty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •