Search a number
-
+
16115111113 is a prime number
BaseRepresentation
bin11110000001000100…
…10001010011001001
31112121002102110120011
433000202101103021
5231000432023423
611223030431521
71110230120143
oct170042212311
945532373504
1016115111113
11691a618552
123158b025a1
13169a88ab0a
14acc377c93
15644b82b0d
hex3c08914c9

16115111113 has 2 divisors, whose sum is σ = 16115111114. Its totient is φ = 16115111112.

The previous prime is 16115111107. The next prime is 16115111203. The reversal of 16115111113 is 31111151161.

It is a m-pointer prime, because the next prime (16115111203) can be obtained adding 16115111113 to its product of digits (90).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8950673664 + 7164437449 = 94608^2 + 84643^2 .

It is a cyclic number.

It is not a de Polignac number, because 16115111113 - 25 = 16115111081 is a prime.

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

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

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

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

Almost surely, 216115111113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 90, while the sum is 22.

Adding to 16115111113 its reverse (31111151161), we get a palindrome (47226262274).

The spelling of 16115111113 in words is "sixteen billion, one hundred fifteen million, one hundred eleven thousand, one hundred thirteen".