Base | Representation |
---|---|
bin | 11110100100011… |
… | …00010000010100 |
3 | 122212111211202100 |
4 | 33102030100110 |
5 | 1011121131103 |
6 | 41240042100 |
7 | 6232410444 |
oct | 1722142024 |
9 | 585454670 |
10 | 256427028 |
11 | 121823470 |
12 | 71a63330 |
13 | 41182b90 |
14 | 260b0124 |
15 | 177a35a3 |
hex | f48c414 |
256427028 has 72 divisors (see below), whose sum is σ = 761525856. Its totient is φ = 71726400.
The previous prime is 256427011. The next prime is 256427047. The reversal of 256427028 is 820724652.
256427028 is a `hidden beast` number, since 2 + 5 + 642 + 7 + 0 + 2 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 256426983 and 256427001.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 19758 + ... + 30053.
It is an arithmetic number, because the mean of its divisors is an integer number (10576748).
Almost surely, 2256427028 is an apocalyptic number.
It is an amenable number.
256427028 is an abundant number, since it is smaller than the sum of its proper divisors (505098828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256427028 is a wasteful number, since it uses less digits than its factorization.
256427028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49845 (or 49840 counting only the distinct ones).
The product of its (nonzero) digits is 53760, while the sum is 36.
The square root of 256427028 is about 16013.3390646673. The cubic root of 256427028 is about 635.3132791909.
It can be divided in two parts, 2564 and 27028, that added together give a palindrome (29592).
The spelling of 256427028 in words is "two hundred fifty-six million, four hundred twenty-seven thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •