Search a number
-
+
101010010011151 is a prime number
BaseRepresentation
bin10110111101111000111001…
…110000111111011000001111
3111020122110111021100012121111
4112331320321300333120033
5101214422000030324101
6554455205154312451
730163506132450253
oct2675707160773017
9436573437305544
10101010010011151
112a20411736465a
12b3b44bbb88727
1344492841c58b7
141ad2ca6866263
15ba277ec20251
hex5bde39c3f60f

101010010011151 has 2 divisors, whose sum is σ = 101010010011152. Its totient is φ = 101010010011150.

The previous prime is 101010010010981. The next prime is 101010010011161. The reversal of 101010010011151 is 151110010010101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 101010010011151 - 221 = 101010007913999 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2101010010011151 is an apocalyptic number.

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

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

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

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

Adding to 101010010011151 its reverse (151110010010101), we get a palindrome (252120020021252).

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