Base | Representation |
---|---|
bin | 101010101110000100010… |
… | …0101110000011110101001 |
3 | 202210022000110222110220121 |
4 | 1111130020211300132221 |
5 | 1232144023242044012 |
6 | 20253133443523241 |
7 | 1144122612014314 |
oct | 125341045603651 |
9 | 22708013873817 |
10 | 5871364409257 |
11 | 1964039163186 |
12 | 7a9ab0089521 |
13 | 33788a055129 |
14 | 164265a0d97b |
15 | a2adacd8a07 |
hex | 557089707a9 |
5871364409257 has 2 divisors, whose sum is σ = 5871364409258. Its totient is φ = 5871364409256.
The previous prime is 5871364409237. The next prime is 5871364409291. The reversal of 5871364409257 is 7529044631785.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5388066930841 + 483297478416 = 2321221^2 + 695196^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5871364409257 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5871364409195 and 5871364409204.
It is not a weakly prime, because it can be changed into another prime (5871364409237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2935682204628 + 2935682204629.
It is an arithmetic number, because the mean of its divisors is an integer number (2935682204629).
It is a 1-persistent number, because it is pandigital, but 2⋅5871364409257 = 11742728818514 is not.
Almost surely, 25871364409257 is an apocalyptic number.
It is an amenable number.
5871364409257 is a deficient number, since it is larger than the sum of its proper divisors (1).
5871364409257 is an equidigital number, since it uses as much as digits as its factorization.
5871364409257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 50803200, while the sum is 61.
The spelling of 5871364409257 in words is "five trillion, eight hundred seventy-one billion, three hundred sixty-four million, four hundred nine thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •