Search a number
-
+
113216115643139 is a prime number
BaseRepresentation
bin11001101111100000101110…
…010110110001001100000011
3112211212100120202112020102102
4121233200232112301030003
5104314413101101040024
61040442433203341015
732563410613445165
oct3157405626611403
9484770522466372
10113216115643139
113308a759819303
121084606008176b
134b23306b36532
141dd5991390935
15d150271161ae
hex66f82e5b1303

113216115643139 has 2 divisors, whose sum is σ = 113216115643140. Its totient is φ = 113216115643138.

The previous prime is 113216115643079. The next prime is 113216115643159. The reversal of 113216115643139 is 931346511612311.

It is a strong prime.

It is an emirp because it is prime and its reverse (931346511612311) is a distict prime.

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 2113216115643139 is an apocalyptic number.

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

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

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

The product of its digits is 349920, while the sum is 47.

The spelling of 113216115643139 in words is "one hundred thirteen trillion, two hundred sixteen billion, one hundred fifteen million, six hundred forty-three thousand, one hundred thirty-nine".