Base | Representation |
---|---|
bin | 111010010100000101100001… |
… | …111111110000101010100001 |
3 | 1020122002000020000121112220212 |
4 | 322110011201333300222201 |
5 | 232103423432210003101 |
6 | 2305243154135143505 |
7 | 105010062665135651 |
oct | 7224054177605241 |
9 | 1218060200545825 |
10 | 256467026250401 |
11 | 7479a06726715a |
12 | 24921040214b95 |
13 | b0149769a4475 |
14 | 47490daca4361 |
15 | 1e9b468a851bb |
hex | e94161ff0aa1 |
256467026250401 has 16 divisors (see below), whose sum is σ = 260835951129600. Its totient is φ = 252121283676288.
The previous prime is 256467026250341. The next prime is 256467026250419. The reversal of 256467026250401 is 104052620764652.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-256467026250401 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 256467026250401.
It is not an unprimeable number, because it can be changed into a prime (256467026250431) 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 in 15 ways as a sum of consecutive naturals, for example, 721209920 + ... + 721565438.
It is an arithmetic number, because the mean of its divisors is an integer number (16302246945600).
Almost surely, 2256467026250401 is an apocalyptic number.
It is an amenable number.
256467026250401 is a deficient number, since it is larger than the sum of its proper divisors (4368924879199).
256467026250401 is a wasteful number, since it uses less digits than its factorization.
256467026250401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 388088.
The product of its (nonzero) digits is 4838400, while the sum is 50.
The spelling of 256467026250401 in words is "two hundred fifty-six trillion, four hundred sixty-seven billion, twenty-six million, two hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •