Search a number
-
+
211001100213061 is a prime number
BaseRepresentation
bin101111111110011110000101…
…101000000001101101000101
31000200002111201110112100110201
4233332132011220001231011
5210124020223123304221
62024432322310250501
762305216651252324
oct5776360550015505
91020074643470421
10211001100213061
1161260078312654
121b7b9515656a31
13909741a609882
143a167173520bb
15195d952122891
hexbfe785a01b45

211001100213061 has 2 divisors, whose sum is σ = 211001100213062. Its totient is φ = 211001100213060.

The previous prime is 211001100213031. The next prime is 211001100213089. The reversal of 211001100213061 is 160312001100112.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 181872357832036 + 29128742381025 = 13486006^2 + 5397105^2 .

It is a cyclic number.

It is not a de Polignac number, because 211001100213061 - 221 = 211001098115909 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2211001100213061 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 211001100213061 its reverse (160312001100112), we get a palindrome (371313101313173).

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