Search a number
-
+
91685092190557 is a prime number
BaseRepresentation
bin10100110110001100011001…
…010110011110100101011101
3110000122000020201022220122211
4110312030121112132211131
544004132032100044212
6522555314435240421
725212013024666135
oct2466143126364535
9400560221286584
1091685092190557
112723947a352878
12a349227a49111
133c20b37015188
14188d821567ac5
15a8ee164e69a7
hex53631959e95d

91685092190557 has 2 divisors, whose sum is σ = 91685092190558. Its totient is φ = 91685092190556.

The previous prime is 91685092190473. The next prime is 91685092190561. The reversal of 91685092190557 is 75509129058619.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 90579931987801 + 1105160202756 = 9517349^2 + 1051266^2 .

It is a cyclic number.

It is not a de Polignac number, because 91685092190557 - 211 = 91685092188509 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 91685092190492 and 91685092190501.

It is a congruent number.

It is a weakly prime.

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

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

Almost surely, 291685092190557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 61236000, while the sum is 67.

The spelling of 91685092190557 in words is "ninety-one trillion, six hundred eighty-five billion, ninety-two million, one hundred ninety thousand, five hundred fifty-seven".