Search a number
-
+
122301222122201 is a prime number
BaseRepresentation
bin11011110011101101111000…
…111001100111001011011001
3121001000212211110012011010212
4123303231320321213023121
5112012240400330402301
61112040223353220505
734521654203401223
oct3363557071471331
9531025743164125
10122301222122201
1135a72725557841
1211872967a01735
135331c56a5b475
14222b5a70ad413
15e2150724c4bb
hex6f3b78e672d9

122301222122201 has 2 divisors, whose sum is σ = 122301222122202. Its totient is φ = 122301222122200.

The previous prime is 122301222122147. The next prime is 122301222122221. The reversal of 122301222122201 is 102221222103221.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 117858924001225 + 4442298120976 = 10856285^2 + 2107676^2 .

It is a cyclic number.

It is not a de Polignac number, because 122301222122201 - 218 = 122301221860057 is a prime.

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

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

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

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

Almost surely, 2122301222122201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 768, while the sum is 23.

Adding to 122301222122201 its reverse (102221222103221), we get a palindrome (224522444225422).

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