Search a number
-
+
155562541513 is a prime number
BaseRepresentation
bin1001000011100001000…
…0000000000111001001
3112212112102100220022121
42100320100000013021
510022043002312023
6155244153051241
714144661533311
oct2207020000711
9485472326277
10155562541513
115aa78aa99a5
12261956b6b21
1311891b1cb42
14775a448441
1540a7104d5d
hex24384001c9

155562541513 has 2 divisors, whose sum is σ = 155562541514. Its totient is φ = 155562541512.

The previous prime is 155562541499. The next prime is 155562541579. The reversal of 155562541513 is 315145265551.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100293822864 + 55268718649 = 316692^2 + 235093^2 .

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

It is a cyclic number.

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

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

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

Almost surely, 2155562541513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 450000, while the sum is 43.

The spelling of 155562541513 in words is "one hundred fifty-five billion, five hundred sixty-two million, five hundred forty-one thousand, five hundred thirteen".