Search a number
-
+
113319659897 is a prime number
BaseRepresentation
bin110100110001001100…
…0001100100101111001
3101211111102221011122122
41221202120030211321
53324034313104042
6124020333331025
711121111134123
oct1514230144571
9354442834578
10113319659897
1144070aa2794
1219b66636a75
13a8bc1a38c2
1456b003a213
152e337807d2
hex1a6260c979

113319659897 has 2 divisors, whose sum is σ = 113319659898. Its totient is φ = 113319659896.

The previous prime is 113319659879. The next prime is 113319659903. The reversal of 113319659897 is 798956913311.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 97730639161 + 15589020736 = 312619^2 + 124856^2 .

It is a cyclic number.

It is not a de Polignac number, because 113319659897 - 28 = 113319659641 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2113319659897 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 11022480, while the sum is 62.

The spelling of 113319659897 in words is "one hundred thirteen billion, three hundred nineteen million, six hundred fifty-nine thousand, eight hundred ninety-seven".