Base | Representation |
---|---|
bin | 1100101110111… |
… | …1100011011101 |
3 | 10201111111202122 |
4 | 3023233203131 |
5 | 102133110023 |
6 | 5144432325 |
7 | 1215656216 |
oct | 313574335 |
9 | 121444678 |
10 | 53410013 |
11 | 2816a808 |
12 | 15a786a5 |
13 | b0b0577 |
14 | 714440d |
15 | 4a502c8 |
hex | 32ef8dd |
53410013 has 4 divisors (see below), whose sum is σ = 53909280. Its totient is φ = 52910748.
The previous prime is 53410009. The next prime is 53410031. The reversal of 53410013 is 31001435.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 53410013 - 22 = 53410009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53409973 and 53410000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53410033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 249473 + ... + 249686.
It is an arithmetic number, because the mean of its divisors is an integer number (13477320).
Almost surely, 253410013 is an apocalyptic number.
It is an amenable number.
53410013 is a deficient number, since it is larger than the sum of its proper divisors (499267).
53410013 is a wasteful number, since it uses less digits than its factorization.
53410013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499266.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 53410013 is about 7308.2154456475. The cubic root of 53410013 is about 376.5947209896.
Adding to 53410013 its reverse (31001435), we get a palindrome (84411448).
The spelling of 53410013 in words is "fifty-three million, four hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •