Base | Representation |
---|---|
bin | 111010010111111110010011… |
… | …010010100101110110110001 |
3 | 1020200000112200201121002212112 |
4 | 322113332103102211312301 |
5 | 232122313010124232201 |
6 | 2310010011500335105 |
7 | 105035300232123515 |
oct | 7227762322456661 |
9 | 1220015621532775 |
10 | 256734141242801 |
11 | 74892379760522 |
12 | 24964968544495 |
13 | b033c058192a1 |
14 | 4757dda76a145 |
15 | 1ea339e1dd0bb |
hex | e97f934a5db1 |
256734141242801 has 2 divisors, whose sum is σ = 256734141242802. Its totient is φ = 256734141242800.
The previous prime is 256734141242767. The next prime is 256734141242809. The reversal of 256734141242801 is 108242141437652.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 169001976005776 + 87732165237025 = 13000076^2 + 9366545^2 .
It is a cyclic number.
It is not a de Polignac number, because 256734141242801 - 26 = 256734141242737 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 256734141242801.
It is not a weakly prime, because it can be changed into another prime (256734141242809) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 128367070621400 + 128367070621401.
It is an arithmetic number, because the mean of its divisors is an integer number (128367070621401).
Almost surely, 2256734141242801 is an apocalyptic number.
It is an amenable number.
256734141242801 is a deficient number, since it is larger than the sum of its proper divisors (1).
256734141242801 is an equidigital number, since it uses as much as digits as its factorization.
256734141242801 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2580480, while the sum is 50.
The spelling of 256734141242801 in words is "two hundred fifty-six trillion, seven hundred thirty-four billion, one hundred forty-one million, two hundred forty-two thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •