256932 has 60 divisors (see below), whose sum is σ = 735196. Its totient is φ = 77760.
The previous prime is 256931. The next prime is 256939. The reversal of 256932 is 239652.
It can be written as a sum of positive squares in 2 ways, for example, as 20736 + 236196 = 144^2 + 486^2 .
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
Its product of digits (3240) is a multiple of the sum of its prime factors (90).
It is a zygodrome in base 3.
It is a junction number, because it is equal to n+sod(n) for n = 256896 and 256905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (256931) by changing a digit.
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 19 ways as a sum of consecutive naturals, for example, 4182 + ... + 4242.
2256932 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 256932, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (367598).
256932 is an abundant number, since it is smaller than the sum of its proper divisors (478264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
256932 is a wasteful number, since it uses less digits than its factorization.
256932 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90 (or 79 counting only the distinct ones).
The product of its digits is 3240, while the sum is 27.
The square root of 256932 is about 506.8846022518. The cubic root of 256932 is about 63.5730038506.
It can be divided in two parts, 2569 and 32, that added together give a square (2601 = 512).
The spelling of 256932 in words is "two hundred fifty-six thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •