Base | Representation |
---|---|
bin | 111010010011101101010110… |
… | …011111100010011011011011 |
3 | 1020121222112012122000122201002 |
4 | 322103231112133202123123 |
5 | 232103012244220402311 |
6 | 2305223222002215215 |
7 | 105005153420030204 |
oct | 7223552637423333 |
9 | 1217875178018632 |
10 | 256441063450331 |
11 | 7478a053a051a1 |
12 | 24917bb535450b |
13 | b012399b56c86 |
14 | 4747b56ad45ab |
15 | 1e9a9495cd93b |
hex | e93b567e26db |
256441063450331 has 2 divisors, whose sum is σ = 256441063450332. Its totient is φ = 256441063450330.
The previous prime is 256441063450309. The next prime is 256441063450333. The reversal of 256441063450331 is 133054360144652.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-256441063450331 is a prime.
It is a super-2 number, since 2×2564410634503312 (a number of 30 digits) contains 22 as substring.
Together with 256441063450333, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (256441063450333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 128220531725165 + 128220531725166.
It is an arithmetic number, because the mean of its divisors is an integer number (128220531725166).
Almost surely, 2256441063450331 is an apocalyptic number.
256441063450331 is a deficient number, since it is larger than the sum of its proper divisors (1).
256441063450331 is an equidigital number, since it uses as much as digits as its factorization.
256441063450331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3110400, while the sum is 47.
The spelling of 256441063450331 in words is "two hundred fifty-six trillion, four hundred forty-one billion, sixty-three million, four hundred fifty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •