Cookie Consent by FreePrivacyPolicy.com
Search a number
-
+
15161 is a prime number
BaseRepresentation
bin11101100111001
3202210112
43230321
5441121
6154105
762126
oct35471
922715
1015161
1110433
128935
136b93
14574d
15475b
hex3b39

15161 has 2 divisors, whose sum is σ = 15162. Its totient is φ = 15160.

The previous prime is 15149. The next prime is 15173. The reversal of 15161 is 16151.

15161 is nontrivially palindromic in base 7.

It is a balanced prime because it is at equal distance from previous prime (15149) and next prime (15173).

It can be written as a sum of positive squares in only one way, i.e., 13225 + 1936 = 115^2 + 44^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

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

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

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

215161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 30, while the sum is 14.

The square root of 15161 is about 123.1300125883. The cubic root of 15161 is about 24.7500425126.

Subtracting 15161 from its reverse (16151), we obtain a triangular number (990 = T44).

It can be divided in two parts, 151 and 61, that added together give a palindrome (212).

The spelling of 15161 in words is "fifteen thousand, one hundred sixty-one".