Search a number
-
+
10101132911 is a prime number
BaseRepresentation
bin10010110100001001…
…10000111001101111
3222001222001201101202
421122010300321233
5131141342223121
64350154200115
7505213133042
oct113204607157
928058051352
1010101132911
11431390a731
121b5aa2303b
13c4c93982c
146bb76ac59
153e1bd840b
hex25a130e6f

10101132911 has 2 divisors, whose sum is σ = 10101132912. Its totient is φ = 10101132910.

The previous prime is 10101132901. The next prime is 10101132931. The reversal of 10101132911 is 11923110101.

It is a happy number.

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

It is an a-pointer prime, because the next prime (10101132931) can be obtained adding 10101132911 to its sum of digits (20).

It is a weak prime.

It is a cyclic number.

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

It is a super-3 number, since 3×101011329113 (a number of 31 digits) contains 333 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 210101132911 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 20.

The spelling of 10101132911 in words is "ten billion, one hundred one million, one hundred thirty-two thousand, nine hundred eleven".