Base | Representation |
---|---|
bin | 11110100001001… |
… | …01011010000000 |
3 | 122211201102212211 |
4 | 33100211122000 |
5 | 1011014141020 |
6 | 41223031504 |
7 | 6226004323 |
oct | 1720453200 |
9 | 584642784 |
10 | 256005760 |
11 | 121565a0a |
12 | 7189b594 |
13 | 410661ca |
14 | 260007ba |
15 | 1771d85a |
hex | f425680 |
256005760 has 32 divisors (see below), whose sum is σ = 612015300. Its totient is φ = 102402048.
The previous prime is 256005749. The next prime is 256005767. The reversal of 256005760 is 67500652.
It can be written as a sum of positive squares in 2 ways, for example, as 245611584 + 10394176 = 15672^2 + 3224^2 .
It is a tau number, because it is divible by the number of its divisors (32).
256005760 is a modest number, since divided by 5760 gives 2560 as remainder.
It is not an unprimeable number, because it can be changed into a prime (256005767) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 199365 + ... + 200644.
Almost surely, 2256005760 is an apocalyptic number.
256005760 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
256005760 is an abundant number, since it is smaller than the sum of its proper divisors (356009540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256005760 is an equidigital number, since it uses as much as digits as its factorization.
256005760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400028 (or 400016 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 31.
The square root of 256005760 is about 16000.1799989875. The cubic root of 256005760 is about 634.9651829547.
The spelling of 256005760 in words is "two hundred fifty-six million, five thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.265 sec. • engine limits •