Search a number
-
+
159251 = 163977
BaseRepresentation
bin100110111000010011
322002110012
4212320103
520044001
63225135
71232201
oct467023
9262405
10159251
11a9714
12781ab
1357641
1442071
15322bb
hex26e13

159251 has 4 divisors (see below), whose sum is σ = 160392. Its totient is φ = 158112.

The previous prime is 159233. The next prime is 159287. The reversal of 159251 is 152951.

159251 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 152951 = 433557.

It is a cyclic number.

It is not a de Polignac number, because 159251 - 210 = 158227 is a prime.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 326 + ... + 651.

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

2159251 is an apocalyptic number.

159251 is the 326-th pentagonal number.

159251 is a deficient number, since it is larger than the sum of its proper divisors (1141).

159251 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 1140.

The product of its digits is 450, while the sum is 23.

The square root of 159251 is about 399.0626517228. The cubic root of 159251 is about 54.2035073505.

The spelling of 159251 in words is "one hundred fifty-nine thousand, two hundred fifty-one".

Divisors: 1 163 977 159251