Search a number
-
+
92901010913 is a prime number
BaseRepresentation
bin101011010000101010…
…1001110110111100001
322212210102122022221222
41112201111032313201
53010230124322123
6110402251024425
76466113364214
oct1264125166741
9285712568858
1092901010913
1136443220577
121600843b115
1389b6b58199
1446d42d777b
15263adba6c8
hex15a154ede1

92901010913 has 2 divisors, whose sum is σ = 92901010914. Its totient is φ = 92901010912.

The previous prime is 92901010883. The next prime is 92901010931. The reversal of 92901010913 is 31901010929.

Together with next prime (92901010931) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 87833991424 + 5067019489 = 296368^2 + 71183^2 .

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

It is a cyclic number.

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

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

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

Almost surely, 292901010913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4374, while the sum is 35.

The spelling of 92901010913 in words is "ninety-two billion, nine hundred one million, ten thousand, nine hundred thirteen".