Search a number
-
+
91659015875513 is a prime number
BaseRepresentation
bin10100110101110100000111…
…000101001110101110111001
3110000112111221102010212011202
4110311310013011032232321
544003220131031004023
6522535323125303545
725210100600656052
oct2465640705165671
9400474842125152
1091659015875513
1127229408a09389
12a34416ab64bb5
133c1b53c801768
14188c46a289729
15a8e3dc0bb128
hex535d0714ebb9

91659015875513 has 2 divisors, whose sum is σ = 91659015875514. Its totient is φ = 91659015875512.

The previous prime is 91659015875477. The next prime is 91659015875561. The reversal of 91659015875513 is 31557851095619.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 90955074739369 + 703941136144 = 9537037^2 + 839012^2 .

It is a cyclic number.

It is not a de Polignac number, because 91659015875513 - 244 = 74066829831097 is a prime.

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

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

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

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

Almost surely, 291659015875513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 51030000, while the sum is 65.

The spelling of 91659015875513 in words is "ninety-one trillion, six hundred fifty-nine billion, fifteen million, eight hundred seventy-five thousand, five hundred thirteen".