Base | Representation |
---|---|
bin | 1100101111100… |
… | …0000110010101 |
3 | 10201120021202221 |
4 | 3023320012111 |
5 | 102140220023 |
6 | 5145302341 |
7 | 1216163236 |
oct | 313700625 |
9 | 121507687 |
10 | 53445013 |
11 | 28194036 |
12 | 15a949b1 |
13 | b0c348b |
14 | 715308d |
15 | 4a5a85d |
hex | 32f8195 |
53445013 has 2 divisors, whose sum is σ = 53445014. Its totient is φ = 53445012.
The previous prime is 53445011. The next prime is 53445053. The reversal of 53445013 is 31054435.
53445013 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 can be written as a sum of positive squares in only one way, i.e., 44063044 + 9381969 = 6638^2 + 3063^2 .
It is a cyclic number.
It is not a de Polignac number, because 53445013 - 21 = 53445011 is a prime.
Together with 53445011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53445011) 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, 26722506 + 26722507.
It is an arithmetic number, because the mean of its divisors is an integer number (26722507).
Almost surely, 253445013 is an apocalyptic number.
It is an amenable number.
53445013 is a deficient number, since it is larger than the sum of its proper divisors (1).
53445013 is an equidigital number, since it uses as much as digits as its factorization.
53445013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 53445013 is about 7310.6096189032. The cubic root of 53445013 is about 376.6769648510.
Adding to 53445013 its reverse (31054435), we get a palindrome (84499448).
The spelling of 53445013 in words is "fifty-three million, four hundred forty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •