Search a number
-
+
16055727705581 is a prime number
BaseRepresentation
bin1110100110100100001111…
…1100100100110111101101
32002211220122021021120022012
43221221003330210313231
54101024112243034311
654051522142131005
73244662620501354
oct351510374446755
962756567246265
1016055727705581
1151302177994a3
12197385a880a65
138c6082aa6825
143d715c21a99b
151cc9a651d78b
hexe9a43f24ded

16055727705581 has 2 divisors, whose sum is σ = 16055727705582. Its totient is φ = 16055727705580.

The previous prime is 16055727705557. The next prime is 16055727705659. The reversal of 16055727705581 is 18550772755061.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 13063056061225 + 2992671644356 = 3614285^2 + 1729934^2 .

It is a cyclic number.

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

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

It is a self number, because there is not a number n which added to its sum of digits gives 16055727705581.

It is a congruent number.

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

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

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

Almost surely, 216055727705581 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 20580000, while the sum is 59.

The spelling of 16055727705581 in words is "sixteen trillion, fifty-five billion, seven hundred twenty-seven million, seven hundred five thousand, five hundred eighty-one".