Base | Representation |
---|---|
bin | 111010011100011011010011… |
… | …100000010101111011001001 |
3 | 1020201002210120210021001212201 |
4 | 322130123103200111323021 |
5 | 232142321222241024101 |
6 | 2310402341523440201 |
7 | 105066352546325251 |
oct | 7234332340257311 |
9 | 1221083523231781 |
10 | 257040161267401 |
11 | 749a0136015366 |
12 | 249b4131b26061 |
13 | b056a24905315 |
14 | 4768b4b210961 |
15 | 1eab31013ce01 |
hex | e9c6d3815ec9 |
257040161267401 has 4 divisors (see below), whose sum is σ = 257040780060100. Its totient is φ = 257039542474704.
The previous prime is 257040161267377. The next prime is 257040161267419. The reversal of 257040161267401 is 104762161040752.
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 147848090118400 + 109192071149001 = 12159280^2 + 10449501^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-257040161267401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (257040161267101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 308772846 + ... + 309604183.
It is an arithmetic number, because the mean of its divisors is an integer number (64260195015025).
Almost surely, 2257040161267401 is an apocalyptic number.
It is an amenable number.
257040161267401 is a deficient number, since it is larger than the sum of its proper divisors (618792699).
257040161267401 is an equidigital number, since it uses as much as digits as its factorization.
257040161267401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 618792698.
The product of its (nonzero) digits is 564480, while the sum is 46.
The spelling of 257040161267401 in words is "two hundred fifty-seven trillion, forty billion, one hundred sixty-one million, two hundred sixty-seven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •