Search a number
-
+
15149 is a prime number
BaseRepresentation
bin11101100101101
3202210002
43230231
5441044
6154045
762111
oct35455
922702
1015149
1110422
128925
136b84
145741
15474e
hex3b2d

15149 has 2 divisors, whose sum is σ = 15150. Its totient is φ = 15148.

The previous prime is 15139. The next prime is 15161. The reversal of 15149 is 94151.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 13924 + 1225 = 118^2 + 35^2 .

It is an emirp because it is prime and its reverse (94151) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-15149 is a prime.

It is a Chen prime.

It is a nialpdrome in base 7.

It is a self number, because there is not a number n which added to its sum of digits gives 15149.

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 15149.

It is not a weakly prime, because it can be changed into another prime (15139) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7574 + 7575.

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

215149 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 180, while the sum is 20.

The square root of 15149 is about 123.0812739616. The cubic root of 15149 is about 24.7435108655.

Subtracting from 15149 its sum of digits (20), we obtain a square (15129 = 1232).

The spelling of 15149 in words is "fifteen thousand, one hundred forty-nine".