Search a number
-
+
111319317139153 is a prime number
BaseRepresentation
bin11001010011111010001100…
…010110101100111011010001
3112121011000121121111120121111
4121103322030112230323101
5104042323430141423103
61032431215512453321
732306361311256214
oct3123721426547321
9477130547446544
10111319317139153
11325192914889a2
121059a51a0aa241
134a1649c455346
141d6bc52c1977b
15cd0a0e46986d
hex653e8c5aced1

111319317139153 has 2 divisors, whose sum is σ = 111319317139154. Its totient is φ = 111319317139152.

The previous prime is 111319317139117. The next prime is 111319317139171. The reversal of 111319317139153 is 351931713913111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 108948357735889 + 2370959403264 = 10437833^2 + 1539792^2 .

It is a cyclic number.

It is not a de Polignac number, because 111319317139153 - 245 = 76134945050321 is a prime.

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

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

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

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

Almost surely, 2111319317139153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 229635, while the sum is 49.

The spelling of 111319317139153 in words is "one hundred eleven trillion, three hundred nineteen billion, three hundred seventeen million, one hundred thirty-nine thousand, one hundred fifty-three".