Base | Representation |
---|---|
bin | 11000010011101000110110… |
… | …00101110111000111000011 |
3 | 21000020220012120101001120222 |
4 | 30021310123011313013003 |
5 | 24001221302031120003 |
6 | 305403110520453255 |
7 | 14154505412665352 |
oct | 1411643305670703 |
9 | 230226176331528 |
10 | 53451322520003 |
11 | 160386400a9051 |
12 | 5bb328391a22b |
13 | 23a9590622335 |
14 | d2b0b48d7999 |
15 | 62a5d17cec38 |
hex | 309d1b1771c3 |
53451322520003 has 2 divisors, whose sum is σ = 53451322520004. Its totient is φ = 53451322520002.
The previous prime is 53451322519943. The next prime is 53451322520041. The reversal of 53451322520003 is 30002522315435.
53451322520003 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 53451322520003 - 212 = 53451322515907 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (53451322520203) 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, 26725661260001 + 26725661260002.
It is an arithmetic number, because the mean of its divisors is an integer number (26725661260002).
Almost surely, 253451322520003 is an apocalyptic number.
53451322520003 is a deficient number, since it is larger than the sum of its proper divisors (1).
53451322520003 is an equidigital number, since it uses as much as digits as its factorization.
53451322520003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108000, while the sum is 35.
Adding to 53451322520003 its reverse (30002522315435), we get a palindrome (83453844835438).
The spelling of 53451322520003 in words is "fifty-three trillion, four hundred fifty-one billion, three hundred twenty-two million, five hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •