Base | Representation |
---|---|
bin | 11110101001111… |
… | …11011000001001 |
3 | 122220220010011212 |
4 | 33110333120021 |
5 | 1011313120323 |
6 | 41303502505 |
7 | 6241554455 |
oct | 1724773011 |
9 | 586803155 |
10 | 257160713 |
11 | 122184717 |
12 | 72157a35 |
13 | 4137bb04 |
14 | 26221665 |
15 | 1789ab78 |
hex | f53f609 |
257160713 has 2 divisors, whose sum is σ = 257160714. Its totient is φ = 257160712.
The previous prime is 257160679. The next prime is 257160731. The reversal of 257160713 is 317061752.
Together with next prime (257160731) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 196756729 + 60403984 = 14027^2 + 7772^2 .
It is a cyclic number.
It is not a de Polignac number, because 257160713 - 28 = 257160457 is a prime.
It is a super-2 number, since 2×2571607132 = 132263264621336738, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 257160713.
It is not a weakly prime, because it can be changed into another prime (257160413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 128580356 + 128580357.
It is an arithmetic number, because the mean of its divisors is an integer number (128580357).
Almost surely, 2257160713 is an apocalyptic number.
It is an amenable number.
257160713 is a deficient number, since it is larger than the sum of its proper divisors (1).
257160713 is an equidigital number, since it uses as much as digits as its factorization.
257160713 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8820, while the sum is 32.
The square root of 257160713 is about 16036.2312592454. The cubic root of 257160713 is about 635.9186183662.
The spelling of 257160713 in words is "two hundred fifty-seven million, one hundred sixty thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •