Search a number
-
+
111002310321313 is a prime number
BaseRepresentation
bin11001001111010010111101…
…010001101010010010100001
3112120000201100212020200122011
4121033102331101222102201
5104022130212420240223
61032025431332312521
732244436504625335
oct3117227521522241
9476021325220564
10111002310321313
11324068a7396744
1210548ba9172741
1349c261c0b7018
141d5a77d1417c5
15cc7658bd880d
hex64f4bd46a4a1

111002310321313 has 2 divisors, whose sum is σ = 111002310321314. Its totient is φ = 111002310321312.

The previous prime is 111002310321307. The next prime is 111002310321347. The reversal of 111002310321313 is 313123013200111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 55837703286369 + 55164607034944 = 7472463^2 + 7427288^2 .

It is a cyclic number.

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

It is not a weakly prime, because it can be changed into another prime (111002310321113) 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, 55501155160656 + 55501155160657.

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

Almost surely, 2111002310321313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 324, while the sum is 22.

Adding to 111002310321313 its reverse (313123013200111), we get a palindrome (424125323521424).

The spelling of 111002310321313 in words is "one hundred eleven trillion, two billion, three hundred ten million, three hundred twenty-one thousand, three hundred thirteen".