Base | Representation |
---|---|
bin | 111010010100100100100101… |
… | …000000010011100100011001 |
3 | 1020122012012021022001202021220 |
4 | 322110210211000103210121 |
5 | 232110000220324042221 |
6 | 2305310350115322253 |
7 | 105012353050356660 |
oct | 7224444500234431 |
9 | 1218165238052256 |
10 | 256500362721561 |
11 | 74802213895372 |
12 | 249275a45b0389 |
13 | b017b5a37b14a |
14 | 474a98049ddd7 |
15 | 1e9c26a5680c6 |
hex | e94925013919 |
256500362721561 has 16 divisors (see below), whose sum is σ = 392114472741888. Its totient is φ = 146100344403600.
The previous prime is 256500362721527. The next prime is 256500362721613. The reversal of 256500362721561 is 165127263005652.
It is not a de Polignac number, because 256500362721561 - 213 = 256500362713369 is a prime.
It is not an unprimeable number, because it can be changed into a prime (256500362721061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19637136535 + ... + 19637149596.
It is an arithmetic number, because the mean of its divisors is an integer number (24507154546368).
Almost surely, 2256500362721561 is an apocalyptic number.
256500362721561 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
256500362721561 is a deficient number, since it is larger than the sum of its proper divisors (135614110020327).
256500362721561 is a wasteful number, since it uses less digits than its factorization.
256500362721561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39274286452.
The product of its (nonzero) digits is 4536000, while the sum is 51.
The spelling of 256500362721561 in words is "two hundred fifty-six trillion, five hundred billion, three hundred sixty-two million, seven hundred twenty-one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •