Base | Representation |
---|---|
bin | 1100101010100… |
… | …1111011000001 |
3 | 10200222000112020 |
4 | 3022221323001 |
5 | 102044443201 |
6 | 5134352053 |
7 | 1213360542 |
oct | 312517301 |
9 | 120860466 |
10 | 53124801 |
11 | 27a954a4 |
12 | 1595b629 |
13 | b0107c2 |
14 | 70ac4c9 |
15 | 49e5a36 |
hex | 32a9ec1 |
53124801 has 12 divisors (see below), whose sum is σ = 71838288. Its totient is φ = 34920864.
The previous prime is 53124791. The next prime is 53124829. The reversal of 53124801 is 10842135.
53124801 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 53124801 - 29 = 53124289 is a prime.
It is a hoax number, since the sum of its digits (24) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (53124101) 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 11 ways as a sum of consecutive naturals, for example, 14326 + ... + 17648.
It is an arithmetic number, because the mean of its divisors is an integer number (5986524).
Almost surely, 253124801 is an apocalyptic number.
It is an amenable number.
53124801 is a deficient number, since it is larger than the sum of its proper divisors (18713487).
53124801 is an equidigital number, since it uses as much as digits as its factorization.
53124801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3472 (or 3399 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 53124801 is about 7288.6762172565. The cubic root of 53124801 is about 375.9231796621.
Adding to 53124801 its reverse (10842135), we get a palindrome (63966936).
The spelling of 53124801 in words is "fifty-three million, one hundred twenty-four thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •