Base | Representation |
---|---|
bin | 11110101000011… |
… | …01011011110110 |
3 | 122220111201120110 |
4 | 33110031123312 |
5 | 1011240044100 |
6 | 41255243450 |
7 | 6240043203 |
oct | 1724153366 |
9 | 586451513 |
10 | 256956150 |
11 | 122054a60 |
12 | 72079586 |
13 | 41309979 |
14 | 261aacaa |
15 | 1785a250 |
hex | f50d6f6 |
256956150 has 48 divisors (see below), whose sum is σ = 695187648. Its totient is φ = 62292000.
The previous prime is 256956149. The next prime is 256956169. The reversal of 256956150 is 51659652.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 256956099 and 256956108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 76216 + ... + 79515.
It is an arithmetic number, because the mean of its divisors is an integer number (14483076).
Almost surely, 2256956150 is an apocalyptic number.
256956150 is an abundant number, since it is smaller than the sum of its proper divisors (438231498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256956150 is a wasteful number, since it uses less digits than its factorization.
256956150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155757 (or 155752 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 39.
The square root of 256956150 is about 16029.8518396147. The cubic root of 256956150 is about 635.7499560966.
The spelling of 256956150 in words is "two hundred fifty-six million, nine hundred fifty-six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •