Base | Representation |
---|---|
bin | 110001101010001011… |
… | …100110101100001111 |
3 | 12002122000221012112001 |
4 | 301222023212230033 |
5 | 1333200141101021 |
6 | 40254554453131 |
7 | 3565226213053 |
oct | 615213465417 |
9 | 162560835461 |
10 | 53321034511 |
11 | 20682374478 |
12 | a4011341a7 |
13 | 5049b082c4 |
14 | 281b823c63 |
15 | 15c1200091 |
hex | c6a2e6b0f |
53321034511 has 2 divisors, whose sum is σ = 53321034512. Its totient is φ = 53321034510.
The previous prime is 53321034509. The next prime is 53321034523. The reversal of 53321034511 is 11543012335.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 53321034511 - 21 = 53321034509 is a prime.
It is a super-3 number, since 3×533210345113 (a number of 33 digits) contains 333 as substring.
Together with 53321034509, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 53321034511.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53321032511) 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 as a sum of consecutive naturals, namely, 26660517255 + 26660517256.
It is an arithmetic number, because the mean of its divisors is an integer number (26660517256).
Almost surely, 253321034511 is an apocalyptic number.
53321034511 is a deficient number, since it is larger than the sum of its proper divisors (1).
53321034511 is an equidigital number, since it uses as much as digits as its factorization.
53321034511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 53321034511 its reverse (11543012335), we get a palindrome (64864046846).
The spelling of 53321034511 in words is "fifty-three billion, three hundred twenty-one million, thirty-four thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •