Search a number
-
+
96703053588913 is a prime number
BaseRepresentation
bin10101111111001101101111…
…001010000110100110110001
3110200101201111001222121121011
4111333031233022012212301
5100133340323204321123
6541400434115030521
726240364550061212
oct2577155712064661
9420351431877534
1096703053588913
11288a3597786802
12aa19848b9b441
1341c609c3127b5
1419c464a56d409
15b2a7059e8e0d
hex57f36f2869b1

96703053588913 has 2 divisors, whose sum is σ = 96703053588914. Its totient is φ = 96703053588912.

The previous prime is 96703053588907. The next prime is 96703053588931. The reversal of 96703053588913 is 31988535030769.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 96574783599009 + 128269989904 = 9827247^2 + 358148^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 296703053588913 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 96703053588913 in words is "ninety-six trillion, seven hundred three billion, fifty-three million, five hundred eighty-eight thousand, nine hundred thirteen".