[go: up one dir, main page]

Search a number
-
+
256422 = 2342737
BaseRepresentation
bin111110100110100110
3111000202010
4332212212
531201142
65255050
72115405
oct764646
9430663
10256422
11165721
12104486
138c93a
146963c
1550e9c
hex3e9a6

256422 has 8 divisors (see below), whose sum is σ = 512856. Its totient is φ = 85472.

The previous prime is 256393. The next prime is 256423. The reversal of 256422 is 224652.

It is a sphenic number, since it is the product of 3 distinct primes.

256422 is an admirable number.

It is a congruent number.

It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 256422.

It is not an unprimeable number, because it can be changed into a prime (256423) by changing a digit.

256422 is an untouchable number, because it is not equal to the sum of proper divisors of any 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 3 ways as a sum of consecutive naturals, for example, 21363 + ... + 21374.

It is an arithmetic number, because the mean of its divisors is an integer number (64107).

2256422 is an apocalyptic number.

256422 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

256422 is a wasteful number, since it uses less digits than its factorization.

256422 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 42742.

The product of its digits is 960, while the sum is 21.

The square root of 256422 is about 506.3812792748. The cubic root of 256422 is about 63.5309126774.

The spelling of 256422 in words is "two hundred fifty-six thousand, four hundred twenty-two".

Divisors: 1 2 3 6 42737 85474 128211 256422