Search a number
-
+
40104516115141 is a prime number
BaseRepresentation
bin10010001111001100011110…
…11011111101101011000101
312020222221202200102202212221
421013212033123331223011
520224033022111141031
6221143432123212341
711306312203261462
oct1107461733755305
9166887680382787
1040104516115141
1111862258908335
1245b86353770b1
13194babb903a8a
149c90d723c669
15498325679a11
hex24798f6fdac5

40104516115141 has 2 divisors, whose sum is σ = 40104516115142. Its totient is φ = 40104516115140.

The previous prime is 40104516115129. The next prime is 40104516115217. The reversal of 40104516115141 is 14151161540104.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 39696980706916 + 407535408225 = 6300554^2 + 638385^2 .

It is a cyclic number.

It is not a de Polignac number, because 40104516115141 - 227 = 40104381897413 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 240104516115141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9600, while the sum is 34.

Adding to 40104516115141 its reverse (14151161540104), we get a palindrome (54255677655245).

The spelling of 40104516115141 in words is "forty trillion, one hundred four billion, five hundred sixteen million, one hundred fifteen thousand, one hundred forty-one".