Search a number
-
+
91403596714561 is a prime number
BaseRepresentation
bin10100110010000110001110…
…111010011101001001000001
3102222122002122210221002202121
4110302012032322131021001
543440024031224331221
6522222122130244241
725152456222634165
oct2462061672351101
9388562583832677
1091403596714561
112714005850531a
12a302767726681
133c00425ac4171
14187dd59c64ca5
15a8793d64ea41
hex53218ee9d241

91403596714561 has 2 divisors, whose sum is σ = 91403596714562. Its totient is φ = 91403596714560.

The previous prime is 91403596714499. The next prime is 91403596714567. The reversal of 91403596714561 is 16541769530419.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 90517033233936 + 886563480625 = 9514044^2 + 941575^2 .

It is a cyclic number.

It is not a de Polignac number, because 91403596714561 - 27 = 91403596714433 is a prime.

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

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

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

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

Almost surely, 291403596714561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24494400, while the sum is 61.

The spelling of 91403596714561 in words is "ninety-one trillion, four hundred three billion, five hundred ninety-six million, seven hundred fourteen thousand, five hundred sixty-one".