Search a number
-
+
13915397 is a prime number
BaseRepresentation
bin110101000101…
…010100000101
3222011222100002
4311011110011
512030243042
61214131045
7226164446
oct65052405
928158302
1013915397
117944931
1247b0a85
132b62a82
141bc32cd
15134d132
hexd45505

13915397 has 2 divisors, whose sum is σ = 13915398. Its totient is φ = 13915396.

The previous prime is 13915357. The next prime is 13915427. The reversal of 13915397 is 79351931.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11930116 + 1985281 = 3454^2 + 1409^2 .

It is a cyclic number.

It is not a de Polignac number, because 13915397 - 28 = 13915141 is a prime.

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 213915397 is an apocalyptic number.

It is an amenable number.

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

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

13915397 is an evil number, because the sum of its binary digits is even.

The product of its digits is 25515, while the sum is 38.

The square root of 13915397 is about 3730.3347034817. The cubic root of 13915397 is about 240.5277564448.

It can be divided in two parts, 13915 and 397, that multiplied together give a palindrome (5524255).

The spelling of 13915397 in words is "thirteen million, nine hundred fifteen thousand, three hundred ninety-seven".