Search a number
-
+
10112120121121 is a prime number
BaseRepresentation
bin1001001100100110100101…
…0100111110011100100001
31022210201011001000112121221
42103021221110332130201
52311134110222333441
633301235512215041
72062401522554014
oct223115124763441
938721131015557
1010112120121121
113249587205547
12117396869a481
13584751969865
1426d601b1937b
1512808d2298d1
hex9326953e721

10112120121121 has 2 divisors, whose sum is σ = 10112120121122. Its totient is φ = 10112120121120.

The previous prime is 10112120121119. The next prime is 10112120121143. The reversal of 10112120121121 is 12112102121101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6742824923025 + 3369295198096 = 2596695^2 + 1835564^2 .

It is a cyclic number.

It is not a de Polignac number, because 10112120121121 - 21 = 10112120121119 is a prime.

Together with 10112120121119, it forms a pair of twin primes.

It is a junction number, because it is equal to n+sod(n) for n = 10112120121095 and 10112120121104.

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

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

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

Almost surely, 210112120121121 is an apocalyptic number.

It is an amenable number.

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

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

10112120121121 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 16.

Adding to 10112120121121 its reverse (12112102121101), we get a palindrome (22224222242222).

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