Search a number
-
+
201011022002213 is a prime number
BaseRepresentation
bin101101101101000110000110…
…100011111111100000100101
3222100201110120201220012122122
4231231012012203333200211
5202321331033113032323
61551303104431435325
760224365340455013
oct5555060643774045
9870643521805578
10201011022002213
1159059328634685
121a665348685b45
138821347bb6907
14378cdb1c278b3
151838b5828dec8
hexb6d1868ff825

201011022002213 has 2 divisors, whose sum is σ = 201011022002214. Its totient is φ = 201011022002212.

The previous prime is 201011022002207. The next prime is 201011022002221. The reversal of 201011022002213 is 312200220110102.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 186734466066724 + 14276555935489 = 13665082^2 + 3778433^2 .

It is a cyclic number.

It is not a de Polignac number, because 201011022002213 - 212 = 201011021998117 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2201011022002213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 96, while the sum is 17.

Adding to 201011022002213 its reverse (312200220110102), we get a palindrome (513211242112315).

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