Base | Representation |
---|---|
bin | 11110100010110… |
… | …00110001001101 |
3 | 122212010010110201 |
4 | 33101120301031 |
5 | 1011042404031 |
6 | 41231333501 |
7 | 6230541556 |
oct | 1721306115 |
9 | 585103421 |
10 | 256216141 |
11 | 121699a85 |
12 | 71981291 |
13 | 4110abac |
14 | 2605732d |
15 | 17760d61 |
hex | f458c4d |
256216141 has 2 divisors, whose sum is σ = 256216142. Its totient is φ = 256216140.
The previous prime is 256216127. The next prime is 256216171. The reversal of 256216141 is 141612652.
256216141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 183710916 + 72505225 = 13554^2 + 8515^2 .
It is a cyclic number.
It is not a de Polignac number, because 256216141 - 25 = 256216109 is a prime.
It is equal to p14000689 and since 256216141 and 14000689 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (256216111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 128108070 + 128108071.
It is an arithmetic number, because the mean of its divisors is an integer number (128108071).
Almost surely, 2256216141 is an apocalyptic number.
It is an amenable number.
256216141 is a deficient number, since it is larger than the sum of its proper divisors (1).
256216141 is an equidigital number, since it uses as much as digits as its factorization.
256216141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2880, while the sum is 28.
The square root of 256216141 is about 16006.7529811639. The cubic root of 256216141 is about 635.1390697120.
Adding to 256216141 its reverse (141612652), we get a palindrome (397828793).
The spelling of 256216141 in words is "two hundred fifty-six million, two hundred sixteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •