Base | Representation |
---|---|
bin | 1110111101110101000… |
… | …1101011001001010101 |
3 | 220120122211010002201221 |
4 | 3233131101223021111 |
5 | 13203033024441443 |
6 | 314041152450341 |
7 | 24401363264341 |
oct | 3573521531125 |
9 | 816584102657 |
10 | 257115468373 |
11 | 9a050a84a25 |
12 | 419b75499b1 |
13 | 1b3272931ca |
14 | c631828621 |
15 | 6a4c840eed |
hex | 3bdd46b255 |
257115468373 has 2 divisors, whose sum is σ = 257115468374. Its totient is φ = 257115468372.
The previous prime is 257115468331. The next prime is 257115468391. The reversal of 257115468373 is 373864511752.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 199293494929 + 57821973444 = 446423^2 + 240462^2 .
It is a cyclic number.
It is not a de Polignac number, because 257115468373 - 213 = 257115460181 is a prime.
It is a super-3 number, since 3×2571154683733 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 257115468373.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (257115468073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 128557734186 + 128557734187.
It is an arithmetic number, because the mean of its divisors is an integer number (128557734187).
Almost surely, 2257115468373 is an apocalyptic number.
It is an amenable number.
257115468373 is a deficient number, since it is larger than the sum of its proper divisors (1).
257115468373 is an equidigital number, since it uses as much as digits as its factorization.
257115468373 is an evil number, because the sum of its binary digits is even.
The product of its digits is 4233600, while the sum is 52.
The spelling of 257115468373 in words is "two hundred fifty-seven billion, one hundred fifteen million, four hundred sixty-eight thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •