Search a number
-
+
110001011111113 is a prime number
BaseRepresentation
bin11001000000101110011011…
…001100010011010011001001
3112102110222211121010112210211
4121000232123030103103021
5103404224032321023423
61025541433351241121
732112211413025423
oct3100563314232311
9472428747115724
10110001011111113
1132060192062a11
1210406b240791a1
13494c0878cbb65
141d24112341813
15cab5a338b10d
hex640b9b3134c9

110001011111113 has 2 divisors, whose sum is σ = 110001011111114. Its totient is φ = 110001011111112.

The previous prime is 110001011111087. The next prime is 110001011111119. The reversal of 110001011111113 is 311111110100011.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 58296095795344 + 51704915315769 = 7635188^2 + 7190613^2 .

It is a cyclic number.

It is not a de Polignac number, because 110001011111113 - 225 = 110000977556681 is a prime.

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

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

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

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

Almost surely, 2110001011111113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 13.

Adding to 110001011111113 its reverse (311111110100011), we get a palindrome (421112121211124).

The spelling of 110001011111113 in words is "one hundred ten trillion, one billion, eleven million, one hundred eleven thousand, one hundred thirteen".