Search a number
-
+
121201112112121 is a prime number
BaseRepresentation
bin11011100011101101010101…
…001110111101101111111001
3120220010201020220010021221201
4123203231111032331233321
5111341224334200041441
61105435004445534201
734346330354530456
oct3343552516755771
9526121226107851
10121201112112121
1135689115098628
1211715707274361
1352822a6246392
1421d024516a82d
15e02abbcbac31
hex6e3b553bdbf9

121201112112121 has 2 divisors, whose sum is σ = 121201112112122. Its totient is φ = 121201112112120.

The previous prime is 121201112112079. The next prime is 121201112112127. The reversal of 121201112112121 is 121211211102121.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102092533687225 + 19108578424896 = 10104085^2 + 4371336^2 .

It is a cyclic number.

It is not a de Polignac number, because 121201112112121 - 221 = 121201110014969 is a prime.

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

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

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

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

Almost surely, 2121201112112121 is an apocalyptic number.

It is an amenable number.

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

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

121201112112121 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 19.

Adding to 121201112112121 its reverse (121211211102121), we get a palindrome (242412323214242).

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