Search a number
-
+
1015139 is a prime number
BaseRepresentation
bin11110111110101100011
31220120111202
43313311203
5224441024
633431415
711425406
oct3676543
91816452
101015139
11633764
1240b56b
13297098
141c5d3d
15150bae
hexf7d63

1015139 has 2 divisors, whose sum is σ = 1015140. Its totient is φ = 1015138.

The previous prime is 1015127. The next prime is 1015159. The reversal of 1015139 is 9315101.

It is an a-pointer prime, because the next prime (1015159) can be obtained adding 1015139 to its sum of digits (20).

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 1015139 - 24 = 1015123 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 1015139.

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

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

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

21015139 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 135, while the sum is 20.

The square root of 1015139 is about 1007.5410661606. The cubic root of 1015139 is about 100.5021079894.

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