Search a number
-
+
161605662015313 is a prime number
BaseRepresentation
bin100100101111101011000000…
…000100111111111101010001
3210012012100110110001201002001
4210233223000010333331101
5132140221343433442223
61331412341034354001
746016423646211225
oct4457530004777521
9705170413051061
10161605662015313
114754663817a66a
121616031528b901
136c2346b978c89
142bc9a81bc4785
1513a3b02a7a9ad
hex92fac013ff51

161605662015313 has 2 divisors, whose sum is σ = 161605662015314. Its totient is φ = 161605662015312.

The previous prime is 161605662015211. The next prime is 161605662015349. The reversal of 161605662015313 is 313510266506161.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 137263999904784 + 24341662110529 = 11715972^2 + 4933727^2 .

It is a cyclic number.

It is not a de Polignac number, because 161605662015313 - 217 = 161605661884241 is a prime.

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

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

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

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

Almost surely, 2161605662015313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 583200, while the sum is 46.

The spelling of 161605662015313 in words is "one hundred sixty-one trillion, six hundred five billion, six hundred sixty-two million, fifteen thousand, three hundred thirteen".