Base | Representation |
---|---|
bin | 11110100100010… |
… | …00111101110000 |
3 | 122212111011021020 |
4 | 33102020331300 |
5 | 1011120213202 |
6 | 41235455440 |
7 | 6232323243 |
oct | 1722107560 |
9 | 585434236 |
10 | 256413552 |
11 | 12181432a |
12 | 71a57580 |
13 | 411799c5 |
14 | 260a925a |
15 | 1779e5bc |
hex | f488f70 |
256413552 has 80 divisors (see below), whose sum is σ = 683899680. Its totient is φ = 82722816.
The previous prime is 256413551. The next prime is 256413557. The reversal of 256413552 is 255314652.
256413552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (256413551) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 626724 + ... + 627132.
It is an arithmetic number, because the mean of its divisors is an integer number (8548746).
Almost surely, 2256413552 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 256413552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (341949840).
256413552 is an abundant number, since it is smaller than the sum of its proper divisors (427486128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256413552 is a wasteful number, since it uses less digits than its factorization.
256413552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 810 (or 804 counting only the distinct ones).
The product of its digits is 36000, while the sum is 33.
The square root of 256413552 is about 16012.9182849348. The cubic root of 256413552 is about 635.3021497976.
The spelling of 256413552 in words is "two hundred fifty-six million, four hundred thirteen thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •