Base | Representation |
---|---|
bin | 11001111111000111111011… |
… | …00110100011100111110001 |
3 | 21111022221221102200222022022 |
4 | 30333203331212203213301 |
5 | 24442223413402232014 |
6 | 321311453135521225 |
7 | 15015360654430013 |
oct | 1477437546434761 |
9 | 244287842628268 |
10 | 57144499649009 |
11 | 17231934330463 |
12 | 64aaba1389215 |
13 | 25b691abc33a6 |
14 | 1017b468c61b3 |
15 | 6916d60eea8e |
hex | 33f8fd9a39f1 |
57144499649009 has 2 divisors, whose sum is σ = 57144499649010. Its totient is φ = 57144499649008.
The previous prime is 57144499648877. The next prime is 57144499649011. The reversal of 57144499649009 is 90094699444175.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34183842423025 + 22960657225984 = 5846695^2 + 4791728^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-57144499649009 is a prime.
Together with 57144499649011, 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 (57144499649089) 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, 28572249824504 + 28572249824505.
It is an arithmetic number, because the mean of its divisors is an integer number (28572249824505).
Almost surely, 257144499649009 is an apocalyptic number.
It is an amenable number.
57144499649009 is a deficient number, since it is larger than the sum of its proper divisors (1).
57144499649009 is an equidigital number, since it uses as much as digits as its factorization.
57144499649009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 352719360, while the sum is 71.
The spelling of 57144499649009 in words is "fifty-seven trillion, one hundred forty-four billion, four hundred ninety-nine million, six hundred forty-nine thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •