Base | Representation |
---|---|
bin | 11000110100000100001001… |
… | …01011001100000001000111 |
3 | 21011012102001211212211222222 |
4 | 30122002010223030001013 |
5 | 24123000111023123221 |
6 | 312015012410042555 |
7 | 14331140502035012 |
oct | 1432020453140107 |
9 | 234172054784888 |
10 | 54565490442311 |
11 | 16428104920842 |
12 | 61531a841945b |
13 | 245a671741b94 |
14 | d68dab8aa379 |
15 | 649590ed39ab |
hex | 31a084acc047 |
54565490442311 has 2 divisors, whose sum is σ = 54565490442312. Its totient is φ = 54565490442310.
The previous prime is 54565490442293. The next prime is 54565490442313. The reversal of 54565490442311 is 11324409456545.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 54565490442311 - 230 = 54564416700487 is a prime.
It is a Sophie Germain prime.
Together with 54565490442313, 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 (54565490442313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27282745221155 + 27282745221156.
It is an arithmetic number, because the mean of its divisors is an integer number (27282745221156).
Almost surely, 254565490442311 is an apocalyptic number.
54565490442311 is a deficient number, since it is larger than the sum of its proper divisors (1).
54565490442311 is an equidigital number, since it uses as much as digits as its factorization.
54565490442311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368000, while the sum is 53.
Adding to 54565490442311 its reverse (11324409456545), we get a palindrome (65889899898856).
The spelling of 54565490442311 in words is "fifty-four trillion, five hundred sixty-five billion, four hundred ninety million, four hundred forty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •