Search a number
-
+
2015711160941 is a prime number
BaseRepresentation
bin11101010101010001101…
…111110110101001101101
321010200220101011112001202
4131111101233312221231
5231011134024122231
64142001021415245
7265426126112012
oct35252157665155
97120811145052
102015711160941
11707949445615
122867a970a525
131181085298ca
146d7bd315709
153767746b5cb
hex1d551bf6a6d

2015711160941 has 2 divisors, whose sum is σ = 2015711160942. Its totient is φ = 2015711160940.

The previous prime is 2015711160901. The next prime is 2015711160989. The reversal of 2015711160941 is 1490611175102.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1988297404900 + 27413756041 = 1410070^2 + 165571^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×20157111609412 (a number of 25 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 2015711160895 and 2015711160904.

It is a congruent number.

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

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

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

Almost surely, 22015711160941 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15120, while the sum is 38.

The spelling of 2015711160941 in words is "two trillion, fifteen billion, seven hundred eleven million, one hundred sixty thousand, nine hundred forty-one".