Base | Representation |
---|---|
bin | 11110101001001… |
… | …11100011111001 |
3 | 122220201011100211 |
4 | 33110213203321 |
5 | 1011302010121 |
6 | 41301431121 |
7 | 6241000165 |
oct | 1724474371 |
9 | 586634324 |
10 | 257063161 |
11 | 1221183a3 |
12 | 7210b4a1 |
13 | 413465a4 |
14 | 261d7ca5 |
15 | 1787bce1 |
hex | f5278f9 |
257063161 has 4 divisors (see below), whose sum is σ = 264010852. Its totient is φ = 250115472.
The previous prime is 257063143. The next prime is 257063207. The reversal of 257063161 is 161360752.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 172423161 + 84640000 = 13131^2 + 9200^2 .
It is a cyclic number.
It is not a de Polignac number, because 257063161 - 29 = 257062649 is a prime.
It is a super-3 number, since 3×2570631613 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (257063461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3473790 + ... + 3473863.
It is an arithmetic number, because the mean of its divisors is an integer number (66002713).
Almost surely, 2257063161 is an apocalyptic number.
It is an amenable number.
257063161 is a deficient number, since it is larger than the sum of its proper divisors (6947691).
257063161 is an equidigital number, since it uses as much as digits as its factorization.
257063161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6947690.
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 257063161 is about 16033.1893583279. The cubic root of 257063161 is about 635.8381978668.
The spelling of 257063161 in words is "two hundred fifty-seven million, sixty-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •