Search a number
-
+
111011102121961 is a prime number
BaseRepresentation
bin11001001111011011001001…
…010011101101111111101001
3112120001120001120120102211101
4121033123021103231333221
5104022301214120400321
61032033443555201401
732245200411662236
oct3117331123557751
9476046046512741
10111011102121961
113240a5a9104698
121054a8415a6261
1349c33c069bc22
141d5ad74a3c78d
15cc79c098b791
hex64f6c94edfe9

111011102121961 has 2 divisors, whose sum is σ = 111011102121962. Its totient is φ = 111011102121960.

The previous prime is 111011102121949. The next prime is 111011102122007. The reversal of 111011102121961 is 169121201110111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 108549830625625 + 2461271496336 = 10418725^2 + 1568844^2 .

It is a cyclic number.

It is not a de Polignac number, because 111011102121961 - 29 = 111011102121449 is a prime.

It is not a weakly prime, because it can be changed into another prime (111011102121911) 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, 55505551060980 + 55505551060981.

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

Almost surely, 2111011102121961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 216, while the sum is 28.

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