Search a number
-
+
13915127 is a prime number
BaseRepresentation
bin110101000101…
…001111110111
3222011221222002
4311011033313
512030241002
61214125515
7226163612
oct65051767
928157862
1013915127
117944706
1247b089b
132b62905
141bc3179
15134d002
hexd453f7

13915127 has 2 divisors, whose sum is σ = 13915128. Its totient is φ = 13915126.

The previous prime is 13915123. The next prime is 13915141. The reversal of 13915127 is 72151931.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 13915127 - 22 = 13915123 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 213915127 is an apocalyptic number.

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

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

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

The product of its digits is 1890, while the sum is 29.

The square root of 13915127 is about 3730.2985135241. The cubic root of 13915127 is about 240.5262007840.

The spelling of 13915127 in words is "thirteen million, nine hundred fifteen thousand, one hundred twenty-seven".