Search a number
-
+
101011100110121 is a prime number
BaseRepresentation
bin10110111101111001111010…
…101111011000110100101001
3111020122120022020112222021102
4112331321322233120310221
5101214431213112010441
6554455505255051145
730163545140235335
oct2675717257306451
9436576266488242
10101011100110121
112a2046267270a3
12b3b4765070ab5
1344493c8cbaa86
141ad2d6b5487c5
15ba27e579c69b
hex5bde7abd8d29

101011100110121 has 2 divisors, whose sum is σ = 101011100110122. Its totient is φ = 101011100110120.

The previous prime is 101011100110117. The next prime is 101011100110139. The reversal of 101011100110121 is 121011001110101.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 97923611844496 + 3087488265625 = 9895636^2 + 1757125^2 .

It is a cyclic number.

It is not a de Polignac number, because 101011100110121 - 22 = 101011100110117 is a prime.

It is not a weakly prime, because it can be changed into another prime (101011100100121) 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, 50505550055060 + 50505550055061.

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

Almost surely, 2101011100110121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2, while the sum is 11.

Adding to 101011100110121 its reverse (121011001110101), we get a palindrome (222022101220222).

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