Search a number
-
+
1011010110013 is a prime number
BaseRepresentation
bin11101011011001001110…
…01100000001000111101
310120122121000212222001101
432231210321200020331
5113031022042010023
62052241315213101
7133020526100101
oct16554471401075
93518530788041
101011010110013
1135a848939572
12143b352a7191
1374451322b37
1436d0c7c9901
151b4731511ad
hexeb64e6023d

1011010110013 has 2 divisors, whose sum is σ = 1011010110014. Its totient is φ = 1011010110012.

The previous prime is 1011010109951. The next prime is 1011010110041. The reversal of 1011010110013 is 3100110101101.

1011010110013 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 can be written as a sum of positive squares in only one way, i.e., 678280722084 + 332729387929 = 823578^2 + 576827^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 21011010110013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1011010110013 its reverse (3100110101101), we get a palindrome (4111120211114).

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