Search a number
-
+
155732151711361 is a prime number
BaseRepresentation
bin100011011010001100110111…
…100101010011011010000001
3202102101211220102012111001011
4203122030313211103122001
5130403003421314230421
61311114210212440521
744542163616321061
oct4332146745233201
9672354812174034
10155732151711361
11456916a8791aa5
1215571b26619141
1368b862c187394
142a656951bd3a1
151300e3d6b14e1
hex8da337953681

155732151711361 has 2 divisors, whose sum is σ = 155732151711362. Its totient is φ = 155732151711360.

The previous prime is 155732151711337. The next prime is 155732151711403. The reversal of 155732151711361 is 163117151237551.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 125434624057600 + 30297527653761 = 11199760^2 + 5504319^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2155732151711361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 661500, while the sum is 49.

The spelling of 155732151711361 in words is "one hundred fifty-five trillion, seven hundred thirty-two billion, one hundred fifty-one million, seven hundred eleven thousand, three hundred sixty-one".