Base | Representation |
---|---|
bin | 1110111010111111101… |
… | …1010010010100001101 |
3 | 220111200210110020112122 |
4 | 3232233323102110031 |
5 | 13200003240443111 |
6 | 313433453142325 |
7 | 24343464233423 |
oct | 3565773222415 |
9 | 814623406478 |
10 | 256354624781 |
11 | 997a0558972 |
12 | 4182478a9a5 |
13 | 1b23576cbb8 |
14 | c59c773113 |
15 | 6a05b50cdb |
hex | 3bafed250d |
256354624781 has 2 divisors, whose sum is σ = 256354624782. Its totient is φ = 256354624780.
The previous prime is 256354624769. The next prime is 256354624783. The reversal of 256354624781 is 187426453652.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 251853422500 + 4501202281 = 501850^2 + 67091^2 .
It is a cyclic number.
It is not a de Polignac number, because 256354624781 - 218 = 256354362637 is a prime.
It is a super-2 number, since 2×2563546247812 (a number of 24 digits) contains 22 as substring.
Together with 256354624783, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (256354624783) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 128177312390 + 128177312391.
It is an arithmetic number, because the mean of its divisors is an integer number (128177312391).
Almost surely, 2256354624781 is an apocalyptic number.
It is an amenable number.
256354624781 is a deficient number, since it is larger than the sum of its proper divisors (1).
256354624781 is an equidigital number, since it uses as much as digits as its factorization.
256354624781 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9676800, while the sum is 53.
The spelling of 256354624781 in words is "two hundred fifty-six billion, three hundred fifty-four million, six hundred twenty-four thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •