Base | Representation |
---|---|
bin | 110001011000000000… |
… | …111111001010110101 |
3 | 12001211210110010021101 |
4 | 301120000333022311 |
5 | 1332034130330201 |
6 | 40204430250101 |
7 | 3554535533323 |
oct | 613000771265 |
9 | 161753403241 |
10 | 53016261301 |
11 | 2053632a893 |
12 | a337056931 |
13 | 4ccb928a23 |
14 | 27cd16ad13 |
15 | 15a459bd01 |
hex | c5803f2b5 |
53016261301 has 16 divisors (see below), whose sum is σ = 54662510448. Its totient is φ = 51397632000.
The previous prime is 53016261283. The next prime is 53016261307. The reversal of 53016261301 is 10316261035.
It can be written as a sum of positive squares in 8 ways, for example, as 4435693201 + 48580568100 = 66601^2 + 220410^2 .
It is a cyclic number.
It is not a de Polignac number, because 53016261301 - 29 = 53016260789 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 53016261301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53016261307) 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 15 ways as a sum of consecutive naturals, for example, 1488501 + ... + 1523701.
It is an arithmetic number, because the mean of its divisors is an integer number (3416406903).
Almost surely, 253016261301 is an apocalyptic number.
It is an amenable number.
53016261301 is a deficient number, since it is larger than the sum of its proper divisors (1646249147).
53016261301 is a wasteful number, since it uses less digits than its factorization.
53016261301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35592.
The product of its (nonzero) digits is 3240, while the sum is 28.
The spelling of 53016261301 in words is "fifty-three billion, sixteen million, two hundred sixty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •