Search a number
-
+
1711521122009 is a prime number
BaseRepresentation
bin11000111001111110100…
…110111100011011011001
320001121201211221110110112
4120321332212330123121
5211020143401401014
63350132325254105
7234440042333366
oct30717646743331
96047654843415
101711521122009
115aa941066026
12237854b64335
13c551b5cc22a
145cba391146d
152e7c1ee973e
hex18e7e9bc6d9

1711521122009 has 2 divisors, whose sum is σ = 1711521122010. Its totient is φ = 1711521122008.

The previous prime is 1711521121949. The next prime is 1711521122011. The reversal of 1711521122009 is 9002211251171.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1600548856384 + 110972265625 = 1265128^2 + 333125^2 .

It is an emirp because it is prime and its reverse (9002211251171) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1711521122009 - 28 = 1711521121753 is a prime.

Together with 1711521122011, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 21711521122009 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2520, while the sum is 32.

The spelling of 1711521122009 in words is "one trillion, seven hundred eleven billion, five hundred twenty-one million, one hundred twenty-two thousand, nine".