Base | Representation |
---|---|
bin | 111001101001100100010001… |
… | …110110111111110010101111 |
3 | 1020020201200020020102122112212 |
4 | 321221210101312333302233 |
5 | 231213040333111431021 |
6 | 2255125002433121035 |
7 | 104256013016003111 |
oct | 7151442166776257 |
9 | 1206650206378485 |
10 | 253545104014511 |
11 | 73872969344261 |
12 | 2452a8a63b917b |
13 | ab6227bc8b7aa |
14 | 46879117313b1 |
15 | 1e4a453bad85b |
hex | e69911dbfcaf |
253545104014511 has 2 divisors, whose sum is σ = 253545104014512. Its totient is φ = 253545104014510.
The previous prime is 253545104014493. The next prime is 253545104014513. The reversal of 253545104014511 is 115410401545352.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-253545104014511 is a prime.
Together with 253545104014513, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (253545104014513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 126772552007255 + 126772552007256.
It is an arithmetic number, because the mean of its divisors is an integer number (126772552007256).
Almost surely, 2253545104014511 is an apocalyptic number.
253545104014511 is a deficient number, since it is larger than the sum of its proper divisors (1).
253545104014511 is an equidigital number, since it uses as much as digits as its factorization.
253545104014511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240000, while the sum is 41.
Adding to 253545104014511 its reverse (115410401545352), we get a palindrome (368955505559863).
The spelling of 253545104014511 in words is "two hundred fifty-three trillion, five hundred forty-five billion, one hundred four million, fourteen thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •