Base | Representation |
---|---|
bin | 11110101000010… |
… | …11000010110000 |
3 | 122220111020010120 |
4 | 33110023002300 |
5 | 1011234240402 |
6 | 41255130240 |
7 | 6240002505 |
oct | 1724130260 |
9 | 586436116 |
10 | 256946352 |
11 | 122048663 |
12 | 72073980 |
13 | 41305380 |
14 | 261a74ac |
15 | 178573bc |
hex | f50b0b0 |
256946352 has 160 divisors (see below), whose sum is σ = 759951360. Its totient is φ = 74234880.
The previous prime is 256946309. The next prime is 256946369. The reversal of 256946352 is 253649652.
It is a happy number.
256946352 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2569463522 = 132042855612215808, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 715549 + ... + 715907.
It is an arithmetic number, because the mean of its divisors is an integer number (4749696).
Almost surely, 2256946352 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 256946352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (379975680).
256946352 is an abundant number, since it is smaller than the sum of its proper divisors (503005008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256946352 is a wasteful number, since it uses less digits than its factorization.
256946352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 451 (or 445 counting only the distinct ones).
The product of its digits is 388800, while the sum is 42.
The square root of 256946352 is about 16029.5462194037. The cubic root of 256946352 is about 635.7418753959.
The spelling of 256946352 in words is "two hundred fifty-six million, nine hundred forty-six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •