Search a number
-
+
11596591159213 is a prime number
BaseRepresentation
bin1010100011000000101010…
…1100100101011110101101
31112001121211101011200100011
42220300022230211132231
53004444304314043323
640355222254333221
72304553224313114
oct250601254453655
945047741150304
1011596591159213
1137710a5428a15
1213735b6aba211
13661727a816b8
142c13c6bcac7b
151519c212520d
hexa8c0ab257ad

11596591159213 has 2 divisors, whose sum is σ = 11596591159214. Its totient is φ = 11596591159212.

The previous prime is 11596591159187. The next prime is 11596591159277. The reversal of 11596591159213 is 31295119569511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10275788014569 + 1320803144644 = 3205587^2 + 1149262^2 .

It is a cyclic number.

It is not a de Polignac number, because 11596591159213 - 233 = 11588001224621 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 211596591159213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3280500, while the sum is 58.

The spelling of 11596591159213 in words is "eleven trillion, five hundred ninety-six billion, five hundred ninety-one million, one hundred fifty-nine thousand, two hundred thirteen".