Search a number
BaseRepresentation
bin111001101001…
…111110010011
31001102212200122
4321221332103
512332123011
61255540455
7242316344
oct71517623
931385618
1015114131
11859351a
12508a72b
133192596
1420160cb
1514d83db
hexe69f93

15114131 has 2 divisors, whose sum is σ = 15114132. Its totient is φ = 15114130.

The previous prime is 15114109. The next prime is 15114137. The reversal of 15114131 is 13141151.

Adding to 15114131 its reverse (13141151), we get a palindrome (28255282).

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 15114131 - 26 = 15114067 is a prime.

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

It is a Chen prime.

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

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

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

Almost surely, 215114131 is an apocalyptic number.

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

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

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

The product of its digits is 60, while the sum is 17.

The square root of 15114131 is about 3887.6896738294. The cubic root of 15114131 is about 247.2451193725.

The spelling of 15114131 in words is "fifteen million, one hundred fourteen thousand, one hundred thirty-one".