Base | Representation |
---|---|
bin | 110000111011000011… |
… | …100101001011011101 |
3 | 12000120221012220121221 |
4 | 300323003211023131 |
5 | 1330040240331023 |
6 | 40044312453341 |
7 | 3536516023045 |
oct | 607303451335 |
9 | 160527186557 |
10 | 52530402013 |
11 | 20307051591 |
12 | a2203aa251 |
13 | 4c5208511b |
14 | 2784816725 |
15 | 1576ac885d |
hex | c3b0e52dd |
52530402013 has 4 divisors (see below), whose sum is σ = 52581852988. Its totient is φ = 52478951040.
The previous prime is 52530402011. The next prime is 52530402031. The reversal of 52530402013 is 31020403525.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10274255044 + 42256146969 = 101362^2 + 205563^2 .
It is a cyclic number.
It is not a de Polignac number, because 52530402013 - 21 = 52530402011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52530402011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25723956 + ... + 25725997.
It is an arithmetic number, because the mean of its divisors is an integer number (13145463247).
Almost surely, 252530402013 is an apocalyptic number.
It is an amenable number.
52530402013 is a deficient number, since it is larger than the sum of its proper divisors (51450975).
52530402013 is a wasteful number, since it uses less digits than its factorization.
52530402013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51450974.
The product of its (nonzero) digits is 3600, while the sum is 25.
Adding to 52530402013 its reverse (31020403525), we get a palindrome (83550805538).
The spelling of 52530402013 in words is "fifty-two billion, five hundred thirty million, four hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •