Search a number
-
+
160555605557 is a prime number
BaseRepresentation
bin1001010110000111011…
…1000001111000110101
3120100102101200211112112
42111201313001320311
510112304213334212
6201431435500405
714412501062324
oct2254167017065
9510371624475
10160555605557
11621004a9906
12271498b7705
13121a93c06c9
147ab16220bb
15429a63b422
hex2561dc1e35

160555605557 has 2 divisors, whose sum is σ = 160555605558. Its totient is φ = 160555605556.

The previous prime is 160555605433. The next prime is 160555605559. The reversal of 160555605557 is 755506555061.

160555605557 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 143873041636 + 16682563921 = 379306^2 + 129161^2 .

It is a cyclic number.

It is not a de Polignac number, because 160555605557 - 234 = 143375736373 is a prime.

Together with 160555605559, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 2160555605557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3937500, while the sum is 50.

The spelling of 160555605557 in words is "one hundred sixty billion, five hundred fifty-five million, six hundred five thousand, five hundred fifty-seven".