Search a number
-
+
101111022121121 is a prime number
BaseRepresentation
bin10110111111010110111110…
…100011100111000010100001
3111021000010012222110001201122
4112333112332203213002201
5101223100333130333441
6555013432354342025
730204013246304555
oct2677267643470241
9437003188401648
10101111022121121
112a242a42034981
12b40bbb088a915
1344559615c257c
141ad7b2a0a7865
15ba51e2c2e34b
hex5bf5be8e70a1

101111022121121 has 2 divisors, whose sum is σ = 101111022121122. Its totient is φ = 101111022121120.

The previous prime is 101111022121099. The next prime is 101111022121159. The reversal of 101111022121121 is 121121220111101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 65842448720896 + 35268573400225 = 8114336^2 + 5938735^2 .

It is a cyclic number.

It is not a de Polignac number, because 101111022121121 - 222 = 101111017926817 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 101111022121121.

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

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

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

Almost surely, 2101111022121121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16, while the sum is 17.

Adding to 101111022121121 its reverse (121121220111101), we get a palindrome (222232242232222).

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