Base | Representation |
---|---|
bin | 1100101000111… |
… | …0101000100111 |
3 | 10200202100012121 |
4 | 3022032220213 |
5 | 102032404111 |
6 | 5132130411 |
7 | 1212413641 |
oct | 312165047 |
9 | 120670177 |
10 | 53013031 |
11 | 27a19525 |
12 | 15906a07 |
13 | aca1976 |
14 | 707d891 |
15 | 49c2871 |
hex | 328ea27 |
53013031 has 2 divisors, whose sum is σ = 53013032. Its totient is φ = 53013030.
The previous prime is 53013019. The next prime is 53013061. The reversal of 53013031 is 13031035.
53013031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53013031 is a prime.
It is a super-2 number, since 2×530130312 = 5620762911613922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53012996 and 53013014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53013061) 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 as a sum of consecutive naturals, namely, 26506515 + 26506516.
It is an arithmetic number, because the mean of its divisors is an integer number (26506516).
Almost surely, 253013031 is an apocalyptic number.
53013031 is a deficient number, since it is larger than the sum of its proper divisors (1).
53013031 is an equidigital number, since it uses as much as digits as its factorization.
53013031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 16.
The square root of 53013031 is about 7281.0048070304. The cubic root of 53013031 is about 375.6593579055.
Adding to 53013031 its reverse (13031035), we get a palindrome (66044066).
The spelling of 53013031 in words is "fifty-three million, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •