Base | Representation |
---|---|
bin | 110001011001011100… |
… | …001000001110100111 |
3 | 12001220110101222020001 |
4 | 301121130020032213 |
5 | 1332111234403021 |
6 | 40211042322131 |
7 | 3555245603032 |
oct | 613134101647 |
9 | 161813358201 |
10 | 53040153511 |
11 | 20548869414 |
12 | a343059347 |
13 | 5003872927 |
14 | 27d23ca019 |
15 | 15a671b091 |
hex | c597083a7 |
53040153511 has 2 divisors, whose sum is σ = 53040153512. Its totient is φ = 53040153510.
The previous prime is 53040153503. The next prime is 53040153533. The reversal of 53040153511 is 11535104035.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 53040153511 - 23 = 53040153503 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 53040153511.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53040153611) 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 as a sum of consecutive naturals, namely, 26520076755 + 26520076756.
It is an arithmetic number, because the mean of its divisors is an integer number (26520076756).
Almost surely, 253040153511 is an apocalyptic number.
53040153511 is a deficient number, since it is larger than the sum of its proper divisors (1).
53040153511 is an equidigital number, since it uses as much as digits as its factorization.
53040153511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 53040153511 its reverse (11535104035), we get a palindrome (64575257546).
The spelling of 53040153511 in words is "fifty-three billion, forty million, one hundred fifty-three thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •