Base | Representation |
---|---|
bin | 1100101010011… |
… | …1101001100100 |
3 | 10200221112202110 |
4 | 3022213221210 |
5 | 102044143432 |
6 | 5134241020 |
7 | 1213321443 |
oct | 312475144 |
9 | 120845673 |
10 | 53115492 |
11 | 27a89501 |
12 | 15956170 |
13 | b0094b1 |
14 | 70a8d5a |
15 | 49e2dcc |
hex | 32a7a64 |
53115492 has 48 divisors (see below), whose sum is σ = 128522240. Its totient is φ = 17061408.
The previous prime is 53115481. The next prime is 53115511. The reversal of 53115492 is 29451135.
53115492 is digitally balanced in base 2 and base 9, because in such bases it contains all the possibile digits an equal number of times.
53115492 is strictly pandigital in base 9.
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, 40113 + ... + 41415.
Almost surely, 253115492 is an apocalyptic number.
It is an amenable number.
53115492 is an abundant number, since it is smaller than the sum of its proper divisors (75406748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53115492 is a wasteful number, since it uses less digits than its factorization.
53115492 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1432 (or 1430 counting only the distinct ones).
The product of its digits is 5400, while the sum is 30.
The square root of 53115492 is about 7288.0375959513. The cubic root of 53115492 is about 375.9012208454.
The spelling of 53115492 in words is "fifty-three million, one hundred fifteen thousand, four hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •