Base | Representation |
---|---|
bin | 100110101010101100010… |
… | …110010011011110111101 |
3 | 100102000122112102210002211 |
4 | 212222230112103132331 |
5 | 322013401404121203 |
6 | 5352405305220421 |
7 | 362655300350164 |
oct | 46525426233675 |
9 | 10360575383084 |
10 | 2657181317053 |
11 | 9349a46431aa |
12 | 36ab90791711 |
13 | 1637569aca13 |
14 | 928730dc3db |
15 | 491bcdc2c6d |
hex | 26aac5937bd |
2657181317053 has 2 divisors, whose sum is σ = 2657181317054. Its totient is φ = 2657181317052.
The previous prime is 2657181316919. The next prime is 2657181317057. The reversal of 2657181317053 is 3507131817562.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2637837236164 + 19344080889 = 1624142^2 + 139083^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2657181317053 is a prime.
It is a super-2 number, since 2×26571813170532 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2657181316988 and 2657181317006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2657181317057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1328590658526 + 1328590658527.
It is an arithmetic number, because the mean of its divisors is an integer number (1328590658527).
Almost surely, 22657181317053 is an apocalyptic number.
It is an amenable number.
2657181317053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2657181317053 is an equidigital number, since it uses as much as digits as its factorization.
2657181317053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1058400, while the sum is 49.
The spelling of 2657181317053 in words is "two trillion, six hundred fifty-seven billion, one hundred eighty-one million, three hundred seventeen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •