Base | Representation |
---|---|
bin | 110001010111101010… |
… | …111001101001010111 |
3 | 12001211101112222011201 |
4 | 301113222321221113 |
5 | 1332031140042021 |
6 | 40204102213331 |
7 | 3554435400424 |
oct | 612752715127 |
9 | 161741488151 |
10 | 53010471511 |
11 | 20533035938 |
12 | a335124247 |
13 | 4cca67c60a |
14 | 27cc4a0d4b |
15 | 15a3d06591 |
hex | c57ab9a57 |
53010471511 has 2 divisors, whose sum is σ = 53010471512. Its totient is φ = 53010471510.
The previous prime is 53010471499. The next prime is 53010471557. The reversal of 53010471511 is 11517401035.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 53010471511 - 29 = 53010470999 is a prime.
It is a super-2 number, since 2×530104715112 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 53010471511.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53010471611) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26505235755 + 26505235756.
It is an arithmetic number, because the mean of its divisors is an integer number (26505235756).
Almost surely, 253010471511 is an apocalyptic number.
53010471511 is a deficient number, since it is larger than the sum of its proper divisors (1).
53010471511 is an equidigital number, since it uses as much as digits as its factorization.
53010471511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2100, while the sum is 28.
Adding to 53010471511 its reverse (11517401035), we get a palindrome (64527872546).
The spelling of 53010471511 in words is "fifty-three billion, ten million, four hundred seventy-one thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •