Base | Representation |
---|---|
bin | 11110101010000… |
… | …00000001001101 |
3 | 122220220020210012 |
4 | 33111000001031 |
5 | 1011313211331 |
6 | 41303523005 |
7 | 6241565231 |
oct | 1725000115 |
9 | 586806705 |
10 | 257163341 |
11 | 122186696 |
12 | 72159465 |
13 | 41380076 |
14 | 262225c1 |
15 | 1789b82b |
hex | f54004d |
257163341 has 2 divisors, whose sum is σ = 257163342. Its totient is φ = 257163340.
The previous prime is 257163323. The next prime is 257163409. The reversal of 257163341 is 143361752.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 231952900 + 25210441 = 15230^2 + 5021^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-257163341 is a prime.
It is a super-2 number, since 2×2571633412 = 132265967908564562, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 257163298 and 257163307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (257163041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 128581670 + 128581671.
It is an arithmetic number, because the mean of its divisors is an integer number (128581671).
Almost surely, 2257163341 is an apocalyptic number.
It is an amenable number.
257163341 is a deficient number, since it is larger than the sum of its proper divisors (1).
257163341 is an equidigital number, since it uses as much as digits as its factorization.
257163341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15120, while the sum is 32.
The square root of 257163341 is about 16036.3131984880. The cubic root of 257163341 is about 635.9207845711.
The spelling of 257163341 in words is "two hundred fifty-seven million, one hundred sixty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •