Search a number
-
+
121020102110153 is a prime number
BaseRepresentation
bin11011100001000100110000…
…001100100110101111001001
3120212111102000222212110110202
4123201010300030212233021
5111330243132120011103
61105215511205221545
734330261643101301
oct3341046014465711
9525442028773422
10121020102110153
1135619378720a84
12116a660b4018b5
13526b1ba2a223c
1421c559317c601
15ded025aa7988
hex6e1130326bc9

121020102110153 has 2 divisors, whose sum is σ = 121020102110154. Its totient is φ = 121020102110152.

The previous prime is 121020102110107. The next prime is 121020102110179. The reversal of 121020102110153 is 351011201020121.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 106643355887929 + 14376746222224 = 10326827^2 + 3791668^2 .

It is a cyclic number.

It is not a de Polignac number, because 121020102110153 - 234 = 121002922240969 is a prime.

It is a super-2 number, since 2×1210201021101532 (a number of 29 digits) contains 22 as substring.

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

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

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

Almost surely, 2121020102110153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 120, while the sum is 20.

Adding to 121020102110153 its reverse (351011201020121), we get a palindrome (472031303130274).

The spelling of 121020102110153 in words is "one hundred twenty-one trillion, twenty billion, one hundred two million, one hundred ten thousand, one hundred fifty-three".