Search a number
-
+
111301200030121 is a prime number
BaseRepresentation
bin11001010011101001010100…
…011111011010100110101001
3112121002021211222222002012021
4121103221110133122212221
5104042024324201430441
61032415022044144441
732305150331343313
oct3123512437324651
9477067758862167
10111301200030121
1132511634889812
1210596b02838121
134a14872ba099a
141d6b014a267b3
15cd02edb7c3d1
hex653a547da9a9

111301200030121 has 2 divisors, whose sum is σ = 111301200030122. Its totient is φ = 111301200030120.

The previous prime is 111301200030107. The next prime is 111301200030179. The reversal of 111301200030121 is 121030002103111.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 111066537293721 + 234662736400 = 10538811^2 + 484420^2 .

It is a cyclic number.

It is not a de Polignac number, because 111301200030121 - 235 = 111266840291753 is a prime.

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

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

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

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

Almost surely, 2111301200030121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 16.

Adding to 111301200030121 its reverse (121030002103111), we get a palindrome (232331202133232).

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