Base | Representation |
---|---|
bin | 111010011100011011101111… |
… | …010010010100110001011001 |
3 | 1020201002211210021021202110202 |
4 | 322130123233102110301121 |
5 | 232142323201100322323 |
6 | 2310402500053351545 |
7 | 105066400236106346 |
oct | 7234335722246131 |
9 | 1221084707252422 |
10 | 257040627354713 |
11 | 749a0355119694 |
12 | 249b42420385b5 |
13 | b056a9a345527 |
14 | 4768b930997cd |
15 | 1eab33b007d28 |
hex | e9c6ef494c59 |
257040627354713 has 2 divisors, whose sum is σ = 257040627354714. Its totient is φ = 257040627354712.
The previous prime is 257040627354677. The next prime is 257040627354773. The reversal of 257040627354713 is 317453726040752.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 234724706449984 + 22315920904729 = 15320728^2 + 4723973^2 .
It is a cyclic number.
It is not a de Polignac number, because 257040627354713 - 210 = 257040627353689 is a prime.
It is a super-3 number, since 3×2570406273547133 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (257040627354773) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 128520313677356 + 128520313677357.
It is an arithmetic number, because the mean of its divisors is an integer number (128520313677357).
Almost surely, 2257040627354713 is an apocalyptic number.
It is an amenable number.
257040627354713 is a deficient number, since it is larger than the sum of its proper divisors (1).
257040627354713 is an equidigital number, since it uses as much as digits as its factorization.
257040627354713 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 29635200, while the sum is 56.
The spelling of 257040627354713 in words is "two hundred fifty-seven trillion, forty billion, six hundred twenty-seven million, three hundred fifty-four thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •