Base | Representation |
---|---|
bin | 11110100001100… |
… | …01101010101000 |
3 | 122211210222202200 |
4 | 33100301222220 |
5 | 1011022242401 |
6 | 41224100200 |
7 | 6226303611 |
oct | 1720615250 |
9 | 584728680 |
10 | 256055976 |
11 | 12159a710 |
12 | 71904660 |
13 | 41083017 |
14 | 26014c08 |
15 | 1772d686 |
hex | f431aa8 |
256055976 has 96 divisors (see below), whose sum is σ = 759957120. Its totient is φ = 77241600.
The previous prime is 256055971. The next prime is 256055999. The reversal of 256055976 is 679550652.
256055976 is a `hidden beast` number, since 2 + 56 + 0 + 5 + 597 + 6 = 666.
It is not an unprimeable number, because it can be changed into a prime (256055971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 214036 + ... + 215228.
It is an arithmetic number, because the mean of its divisors is an integer number (7916220).
Almost surely, 2256055976 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 256055976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (379978560).
256055976 is an abundant number, since it is smaller than the sum of its proper divisors (503901144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256055976 is a wasteful number, since it uses less digits than its factorization.
256055976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1487 (or 1480 counting only the distinct ones).
The product of its (nonzero) digits is 567000, while the sum is 45.
The square root of 256055976 is about 16001.7491543893. The cubic root of 256055976 is about 635.0066967694.
The spelling of 256055976 in words is "two hundred fifty-six million, fifty-five thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •