Search a number
-
+
111161115001 is a prime number
BaseRepresentation
bin110011110000110111…
…0000000000101111001
3101121221000020201201101
41213201232000011321
53310124221140001
6123022224251401
711013450613246
oct1474156000571
9347830221641
10111161115001
1143163607a92
1219663770b61
13a636c281c1
1455474b05cd
152d59001a01
hex19e1b80179

111161115001 has 2 divisors, whose sum is σ = 111161115002. Its totient is φ = 111161115000.

The previous prime is 111161114951. The next prime is 111161115007. The reversal of 111161115001 is 100511161111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 106733543401 + 4427571600 = 326701^2 + 66540^2 .

It is a cyclic number.

It is not a de Polignac number, because 111161115001 - 235 = 76801376633 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 111161115001.

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

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

Almost surely, 2111161115001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 30, while the sum is 19.

Adding to 111161115001 its reverse (100511161111), we get a palindrome (211672276112).

The spelling of 111161115001 in words is "one hundred eleven billion, one hundred sixty-one million, one hundred fifteen thousand, one".