Search a number
-
+
92711705557 is a prime number
BaseRepresentation
bin101011001011000001…
…1000101101111010101
322212022020102121211111
41112112003011233111
53004333144034212
6110331405335021
76461324331442
oct1262603055725
9285266377744
1092711705557
1136356382669
1215b74b67471
138986876993
1446b70da9c9
152629474ea7
hex15960c5bd5

92711705557 has 2 divisors, whose sum is σ = 92711705558. Its totient is φ = 92711705556.

The previous prime is 92711705543. The next prime is 92711705587. The reversal of 92711705557 is 75550711729.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 82598185201 + 10113520356 = 287399^2 + 100566^2 .

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

It is a cyclic number.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (92711705587) 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, 46355852778 + 46355852779.

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

Almost surely, 292711705557 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 92711705557 in words is "ninety-two billion, seven hundred eleven million, seven hundred five thousand, five hundred fifty-seven".