Base | Representation |
---|---|
bin | 1100101010010… |
… | …0110110001101 |
3 | 10200220222000022 |
4 | 3022210312031 |
5 | 102043312023 |
6 | 5134111525 |
7 | 1213243124 |
oct | 312446615 |
9 | 120828008 |
10 | 53104013 |
11 | 27a80916 |
12 | 1594b5a5 |
13 | b0041c1 |
14 | 70a4abb |
15 | 49de7c8 |
hex | 32a4d8d |
53104013 has 2 divisors, whose sum is σ = 53104014. Its totient is φ = 53104012.
The previous prime is 53103997. The next prime is 53104027. The reversal of 53104013 is 31040135.
53104013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 52157284 + 946729 = 7222^2 + 973^2 .
It is a cyclic number.
It is not a de Polignac number, because 53104013 - 24 = 53103997 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 53103982 and 53104000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53104043) 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, 26552006 + 26552007.
It is an arithmetic number, because the mean of its divisors is an integer number (26552007).
Almost surely, 253104013 is an apocalyptic number.
It is an amenable number.
53104013 is a deficient number, since it is larger than the sum of its proper divisors (1).
53104013 is an equidigital number, since it uses as much as digits as its factorization.
53104013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 53104013 is about 7287.2500300182. The cubic root of 53104013 is about 375.8741397257.
Adding to 53104013 its reverse (31040135), we get a palindrome (84144148).
The spelling of 53104013 in words is "fifty-three million, one hundred four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •