Search a number
-
+
121020111020713 is a prime number
BaseRepresentation
bin11011100001000100110000…
…101110100110001010101001
3120212111102001121122011110111
4123201010300232212022221
5111330243141410130323
61105215512124214321
734330262111612512
oct3341046056461251
9525442047564414
10121020111020713
1135619382757683
12116a661239a3a1
13526b1bc0a1c68
1421c559441ba09
15ded026767c0d
hex6e1130ba62a9

121020111020713 has 2 divisors, whose sum is σ = 121020111020714. Its totient is φ = 121020111020712.

The previous prime is 121020111020623. The next prime is 121020111021221. The reversal of 121020111020713 is 317020111020121.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 82776733741584 + 38243377279129 = 9098172^2 + 6184123^2 .

It is a cyclic number.

It is not a de Polignac number, because 121020111020713 - 229 = 121019574149801 is a prime.

It is a super-3 number, since 3×1210201110207133 (a number of 43 digits) contains 333 as substring.

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

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

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

Almost surely, 2121020111020713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 168, while the sum is 22.

Adding to 121020111020713 its reverse (317020111020121), we get a palindrome (438040222040834).

The spelling of 121020111020713 in words is "one hundred twenty-one trillion, twenty billion, one hundred eleven million, twenty thousand, seven hundred thirteen".