Search a number
-
+
211012111211017 is a prime number
BaseRepresentation
bin101111111110101000010101…
…111011101001101000001001
31000200010120010211200000001211
4233332220111323221220021
5210124210300432223032
62024441343050213121
762306056553222224
oct5776502573515011
91020116124600054
10211012111211017
1161264808782366
121b7bb6891241a1
1390984838b508c
143a1707d8865bb
15195dd98b35747
hexbfea15ee9a09

211012111211017 has 2 divisors, whose sum is σ = 211012111211018. Its totient is φ = 211012111211016.

The previous prime is 211012111210993. The next prime is 211012111211021. The reversal of 211012111211017 is 710112111210112.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 188351359981456 + 22660751229561 = 13724116^2 + 4760331^2 .

It is a cyclic number.

It is not a de Polignac number, because 211012111211017 - 27 = 211012111210889 is a prime.

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

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

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

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

Almost surely, 2211012111211017 is an apocalyptic number.

It is an amenable number.

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

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

211012111211017 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 22.

Adding to 211012111211017 its reverse (710112111210112), we get a palindrome (921124222421129).

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