Search a number
-
+
2015317151 is a prime number
BaseRepresentation
bin111100000011111…
…0100110010011111
312012110011201101222
41320013310302133
513111410122101
6531551123555
7100640625131
oct17007646237
95173151358
102015317151
11944659671
12482b135bb
132616ab173
14151925051
15bbddb01b
hex781f4c9f

2015317151 has 2 divisors, whose sum is σ = 2015317152. Its totient is φ = 2015317150.

The previous prime is 2015317141. The next prime is 2015317159. The reversal of 2015317151 is 1517135102.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-2015317151 is a prime.

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

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

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

Almost surely, 22015317151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1050, while the sum is 26.

The square root of 2015317151 is about 44892.2838692798. The cubic root of 2015317151 is about 1263.1292738005.

The spelling of 2015317151 in words is "two billion, fifteen million, three hundred seventeen thousand, one hundred fifty-one".