Search a number
-
+
91685092190273 is a prime number
BaseRepresentation
bin10100110110001100011001…
…010110011110100001000001
3110000122000020201022220021022
4110312030121112132201001
544004132032100042043
6522555314435235225
725212013024665251
oct2466143126364101
9400560221286238
1091685092190273
112723947a35263a
12a349227a48b15
133c20b37014cca
14188d821567961
15a8ee164e6868
hex53631959e841

91685092190273 has 2 divisors, whose sum is σ = 91685092190274. Its totient is φ = 91685092190272.

The previous prime is 91685092190203. The next prime is 91685092190281. The reversal of 91685092190273 is 37209129058619.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 68230375388224 + 23454716802049 = 8260168^2 + 4843007^2 .

It is a cyclic number.

It is not a de Polignac number, because 91685092190273 - 220 = 91685091141697 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 291685092190273 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14696640, while the sum is 62.

The spelling of 91685092190273 in words is "ninety-one trillion, six hundred eighty-five billion, ninety-two million, one hundred ninety thousand, two hundred seventy-three".