Base | Representation |
---|---|
bin | 11110100101111… |
… | …10110100000000 |
3 | 122212220100211010 |
4 | 33102332310000 |
5 | 1011144242422 |
6 | 41244320520 |
7 | 6234232260 |
oct | 1722766400 |
9 | 585810733 |
10 | 256634112 |
11 | 121955009 |
12 | 71b43140 |
13 | 41226207 |
14 | 261257a0 |
15 | 177e4b0c |
hex | f4bed00 |
256634112 has 72 divisors (see below), whose sum is σ = 780611776. Its totient is φ = 73322496.
The previous prime is 256634111. The next prime is 256634113. The reversal of 256634112 is 211436652.
256634112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (256634111) and next prime (256634113).
It is a super-2 number, since 2×2566341122 = 131722134884057088, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 256634112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (256634111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18493 + ... + 29244.
Almost surely, 2256634112 is an apocalyptic number.
It is an amenable number.
256634112 is an abundant number, since it is smaller than the sum of its proper divisors (523977664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256634112 is an equidigital number, since it uses as much as digits as its factorization.
256634112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47763 (or 47749 counting only the distinct ones).
The product of its digits is 8640, while the sum is 30.
The square root of 256634112 is about 16019.8037441162. The cubic root of 256634112 is about 635.4842541674.
The spelling of 256634112 in words is "two hundred fifty-six million, six hundred thirty-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •