Search a number
-
+
111211111211153 is a prime number
BaseRepresentation
bin11001010010010101011010…
…110001110110000010010001
3112120202200022112221220100112
4121102111122301312002101
5104034040323432224103
61032305402412131105
732265511003123322
oct3122253261660221
9476680275856315
10111211111211153
1132487405013718
1210581560166a95
134a09216851205
141d6690a008449
15ccccc9b08cd8
hex65255ac76091

111211111211153 has 2 divisors, whose sum is σ = 111211111211154. Its totient is φ = 111211111211152.

The previous prime is 111211111211149. The next prime is 111211111211243. The reversal of 111211111211153 is 351112111112111.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100215175627009 + 10995935584144 = 10010753^2 + 3316012^2 .

It is a cyclic number.

It is not a de Polignac number, because 111211111211153 - 22 = 111211111211149 is a prime.

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

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

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

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

Almost surely, 2111211111211153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 60, while the sum is 23.

Adding to 111211111211153 its reverse (351112111112111), we get a palindrome (462323222323264).

The spelling of 111211111211153 in words is "one hundred eleven trillion, two hundred eleven billion, one hundred eleven million, two hundred eleven thousand, one hundred fifty-three".