Search a number
-
+
201001202122013 is a prime number
BaseRepresentation
bin101101101100111100111101…
…010000000111110100011101
3222100200112020101001121102222
4231230330331100013310131
5202321200430220401023
61551254402201355125
760223600111040456
oct5554747520076435
9870615211047388
10201001202122013
1159055149564307
121a663467a98aa5
138820441612a07
14378c71d99012d
15183878110ecc8
hexb6cf3d407d1d

201001202122013 has 2 divisors, whose sum is σ = 201001202122014. Its totient is φ = 201001202122012.

The previous prime is 201001202121947. The next prime is 201001202122027. The reversal of 201001202122013 is 310221202100102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 181942276005604 + 19058926116409 = 13488598^2 + 4365653^2 .

It is a cyclic number.

It is not a de Polignac number, because 201001202122013 - 220 = 201001201073437 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2201001202122013 is an apocalyptic number.

It is an amenable number.

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

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

201001202122013 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 201001202122013 its reverse (310221202100102), we get a palindrome (511222404222115).

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