Search a number
BaseRepresentation
bin11101100011011
3202202102
43230123
5441011
6154015
762054
oct35433
922672
1015131
1110406
12890b
136b6c
14572b
15473b
hex3b1b

15131 has 2 divisors, whose sum is σ = 15132. Its totient is φ = 15130.

The previous prime is 15121. The next prime is 15137. The reversal of 15131 is 13151.

Adding to 15131 its reverse (13151), we get a palindrome (28282).

15131 = T68 + T69 + ... + T73.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 15131 - 210 = 14107 is a prime.

It is a super-2 number, since 2×151312 = 457894322, which contains 22 as substring.

It is a Chen prime.

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

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

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

215131 is an apocalyptic number.

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

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

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

The product of its digits is 15, while the sum is 11.

The square root of 15131 is about 123.0081298126. The cubic root of 15131 is about 24.7337069244.

The spelling of 15131 in words is "fifteen thousand, one hundred thirty-one".