Search a number
-
+
1010010115111 is a prime number
BaseRepresentation
bin11101011001010010100…
…10110100110000100111
310120120000100012221221011
432230221102310300213
5113022000042140421
62051554154003051
7132653664220054
oct16545122646047
93516010187834
101010010115111
1135a3854195a8
121438b6416487
13743220b808a
1436c55a8002b
151b4154714e1
hexeb294b4c27

1010010115111 has 2 divisors, whose sum is σ = 1010010115112. Its totient is φ = 1010010115110.

The previous prime is 1010010115067. The next prime is 1010010115151. The reversal of 1010010115111 is 1115110100101.

1010010115111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1010010115111 - 231 = 1007862631463 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21010010115111 is an apocalyptic number.

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

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

1010010115111 is an evil number, because the sum of its binary digits is even.

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

Adding to 1010010115111 its reverse (1115110100101), we get a palindrome (2125120215212).

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