Base | Representation |
---|---|
bin | 11000010011101010111011… |
… | …11110010001001100000011 |
3 | 21000021000002202202210021122 |
4 | 30021311131332101030003 |
5 | 24001231101304300024 |
6 | 305403414122542455 |
7 | 14154545256354641 |
oct | 1411653576211403 |
9 | 230230082683248 |
10 | 53452444603139 |
11 | 1603906652678a |
12 | 5bb3537667a2b |
13 | 23a970bc3565a |
14 | d2b17d944191 |
15 | 62a64a078d5e |
hex | 309d5df91303 |
53452444603139 has 2 divisors, whose sum is σ = 53452444603140. Its totient is φ = 53452444603138.
The previous prime is 53452444603093. The next prime is 53452444603141. The reversal of 53452444603139 is 93130644425435.
It is a happy number.
53452444603139 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53452444603139 - 240 = 52352932975363 is a prime.
Together with 53452444603141, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (53452444606139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26726222301569 + 26726222301570.
It is an arithmetic number, because the mean of its divisors is an integer number (26726222301570).
Almost surely, 253452444603139 is an apocalyptic number.
53452444603139 is a deficient number, since it is larger than the sum of its proper divisors (1).
53452444603139 is an equidigital number, since it uses as much as digits as its factorization.
53452444603139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18662400, while the sum is 53.
The spelling of 53452444603139 in words is "fifty-three trillion, four hundred fifty-two billion, four hundred forty-four million, six hundred three thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •