Search a number
-
+
201102210099961 is a prime number
BaseRepresentation
bin101101101110011011000001…
…110010111110101011111001
3222101001011221210101112111021
4231232123001302332223321
5202324324311241144321
61551413025133102441
760234104144505262
oct5556330162765371
9871034853345437
10201102210099961
1159093a71972135
121a67ab57327a21
138829b1abc39c1
143793582837969
15183b1e3aa4941
hexb6e6c1cbeaf9

201102210099961 has 2 divisors, whose sum is σ = 201102210099962. Its totient is φ = 201102210099960.

The previous prime is 201102210099953. The next prime is 201102210100061. The reversal of 201102210099961 is 169990012201102.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 177258335545600 + 23843874554361 = 13313840^2 + 4883019^2 .

It is a cyclic number.

It is not a de Polignac number, because 201102210099961 - 23 = 201102210099953 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 2201102210099961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 34992, while the sum is 43.

The spelling of 201102210099961 in words is "two hundred one trillion, one hundred two billion, two hundred ten million, ninety-nine thousand, nine hundred sixty-one".