Base | Representation |
---|---|
bin | 1100101100011… |
… | …1100010110001 |
3 | 10201012011221212 |
4 | 3023013202301 |
5 | 102112334004 |
6 | 5141125505 |
7 | 1214404346 |
oct | 313074261 |
9 | 121164855 |
10 | 53246129 |
11 | 28068672 |
12 | 159b9895 |
13 | b053ab1 |
14 | 71007cd |
15 | 4a1b96e |
hex | 32c78b1 |
53246129 has 8 divisors (see below), whose sum is σ = 53887680. Its totient is φ = 52608400.
The previous prime is 53246111. The next prime is 53246131. The reversal of 53246129 is 92164235.
It is a happy number.
53246129 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 53246129 - 220 = 52197553 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 53246095 and 53246104.
It is not an unprimeable number, because it can be changed into a prime (53246029) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 34484 + ... + 35994.
It is an arithmetic number, because the mean of its divisors is an integer number (6735960).
Almost surely, 253246129 is an apocalyptic number.
It is an amenable number.
53246129 is a deficient number, since it is larger than the sum of its proper divisors (641551).
53246129 is a wasteful number, since it uses less digits than its factorization.
53246129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1911.
The product of its digits is 12960, while the sum is 32.
The square root of 53246129 is about 7296.9945182931. The cubic root of 53246129 is about 376.2091435863.
The spelling of 53246129 in words is "fifty-three million, two hundred forty-six thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •