Base | Representation |
---|---|
bin | 1100101001101… |
… | …1000111011000 |
3 | 10200211221022222 |
4 | 3022123013120 |
5 | 102041023102 |
6 | 5133203212 |
7 | 1213015661 |
oct | 312330730 |
9 | 120757288 |
10 | 53064152 |
11 | 27a53979 |
12 | 15930508 |
13 | acbc00b |
14 | 7094368 |
15 | 49d2aa2 |
hex | 329b1d8 |
53064152 has 8 divisors (see below), whose sum is σ = 99495300. Its totient is φ = 26532072.
The previous prime is 53064139. The next prime is 53064173. The reversal of 53064152 is 25146035.
53064152 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 (8).
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 as a sum of consecutive naturals, namely, 3316502 + ... + 3316517.
Almost surely, 253064152 is an apocalyptic number.
It is an amenable number.
53064152 is a deficient number, since it is larger than the sum of its proper divisors (46431148).
53064152 is a wasteful number, since it uses less digits than its factorization.
53064152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6633025 (or 6633021 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 53064152 is about 7284.5145342706. The cubic root of 53064152 is about 375.7800698140.
The spelling of 53064152 in words is "fifty-three million, sixty-four thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •