Search a number
-
+
2001211201117 is a prime number
BaseRepresentation
bin11101000111110001011…
…110111001011001011101
321002022110211221020112201
4131013301132321121131
5230241440031413432
64131202125131501
7264403610354452
oct35076136713135
97068424836481
102001211201117
11701788608147
12283a216b9b91
1311693747b01b
146cc05697829
15370c94cbee7
hex1d1f17b965d

2001211201117 has 2 divisors, whose sum is σ = 2001211201118. Its totient is φ = 2001211201116.

The previous prime is 2001211201109. The next prime is 2001211201237. The reversal of 2001211201117 is 7111021121002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1613563008121 + 387648192996 = 1270261^2 + 622614^2 .

It is a cyclic number.

It is not a de Polignac number, because 2001211201117 - 23 = 2001211201109 is a prime.

It is a super-2 number, since 2×20012112011172 (a number of 25 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

Almost surely, 22001211201117 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 56, while the sum is 19.

Adding to 2001211201117 its reverse (7111021121002), we get a palindrome (9112232322119).

The spelling of 2001211201117 in words is "two trillion, one billion, two hundred eleven million, two hundred one thousand, one hundred seventeen".