Search a number
-
+
15809617032061 is a prime number
BaseRepresentation
bin1110011000001111011010…
…0110110111001101111101
32001222101101101121222002211
43212003312212313031331
54033011043430011221
653342500544220421
73221131022340016
oct346036646671575
961871341558084
1015809617032061
115045903727856
12193401490a711
138a8ac0729568
143c929219000d
151c639edb76e1
hexe60f69b737d

15809617032061 has 2 divisors, whose sum is σ = 15809617032062. Its totient is φ = 15809617032060.

The previous prime is 15809617031963. The next prime is 15809617032071. The reversal of 15809617032061 is 16023071690851.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13510696976100 + 2298920055961 = 3675690^2 + 1516219^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 15809617032061 - 211 = 15809617030013 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 215809617032061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 544320, while the sum is 49.

The spelling of 15809617032061 in words is "fifteen trillion, eight hundred nine billion, six hundred seventeen million, thirty-two thousand, sixty-one".