Search a number
-
+
101220111220121 is a prime number
BaseRepresentation
bin10111000000111100100100…
…110001011111110110011001
3111021101112210120211110211122
4113000330210301133312121
5101231342241433020441
6555135513244335025
730214624500325145
oct2700744461376631
9437345716743748
10101220111220121
112a285231a87643
12b429176544475
13446302817a0aa
141add1182d4225
15ba7e79d9534b
hex5c0f24c5fd99

101220111220121 has 2 divisors, whose sum is σ = 101220111220122. Its totient is φ = 101220111220120.

The previous prime is 101220111220103. The next prime is 101220111220181. The reversal of 101220111220121 is 121022111022101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 82705928718400 + 18514182501721 = 9094280^2 + 4302811^2 .

It is a cyclic number.

It is not a de Polignac number, because 101220111220121 - 226 = 101220044111257 is a prime.

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

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

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

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

Almost surely, 2101220111220121 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 101220111220121 its reverse (121022111022101), we get a palindrome (222242222242222).

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