Search a number
-
+
11010010100101 is a prime number
BaseRepresentation
bin1010000000110111011110…
…1111011011000110000101
31102222112202112102110011121
42200031313233123012011
52420342000041200401
635225532342433541
72214306212502535
oct240156757330605
942875675373147
1011010010100101
113565356742311
1212999921328b1
1361b3162397cc
142a0c5cba74c5
151415e03aeca1
hexa0377bdb185

11010010100101 has 2 divisors, whose sum is σ = 11010010100102. Its totient is φ = 11010010100100.

The previous prime is 11010010099931. The next prime is 11010010100147. The reversal of 11010010100101 is 10100101001011.

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., 9493787277601 + 1516222822500 = 3081199^2 + 1231350^2 .

It is a cyclic number.

It is not a de Polignac number, because 11010010100101 - 227 = 11009875882373 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 211010010100101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1, while the sum is 7.

Adding to 11010010100101 its reverse (10100101001011), we get a palindrome (21110111101112).

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