Base | Representation |
---|---|
bin | 11110101000000… |
… | …10100001110000 |
3 | 122220102110021201 |
4 | 33110002201300 |
5 | 1011232131342 |
6 | 41254300544 |
7 | 6236466016 |
oct | 1724024160 |
9 | 586373251 |
10 | 256911472 |
11 | 122024434 |
12 | 72057754 |
13 | 412c252c |
14 | 261988b6 |
15 | 1784bdb7 |
hex | f502870 |
256911472 has 40 divisors (see below), whose sum is σ = 522716544. Its totient is φ = 122088384.
The previous prime is 256911469. The next prime is 256911481. The reversal of 256911472 is 274119652.
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 7 ways as a sum of consecutive naturals, for example, 57843 + ... + 62125.
Almost surely, 2256911472 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 256911472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (261358272).
256911472 is an abundant number, since it is smaller than the sum of its proper divisors (265805072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256911472 is a wasteful number, since it uses less digits than its factorization.
256911472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4477 (or 4471 counting only the distinct ones).
The product of its digits is 30240, while the sum is 37.
The square root of 256911472 is about 16028.4581916041. The cubic root of 256911472 is about 635.7131071596.
It can be divided in two parts, 2569 and 11472, that added together give a palindrome (14041).
The spelling of 256911472 in words is "two hundred fifty-six million, nine hundred eleven thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •