Search a number
-
+
111122122022231 is a prime number
BaseRepresentation
bin11001010001000010100010…
…100111000001110101010111
3112120110011121202002201100112
4121101002202213001311113
5104031111101214202411
61032200444221033235
732256210526365665
oct3121024247016527
9476404552081315
10111122122022231
1132452699a2a991
12105682659b581b
134a00a04282bc8
141d624a746dc35
15cca81c396b8b
hex6510a29c1d57

111122122022231 has 2 divisors, whose sum is σ = 111122122022232. Its totient is φ = 111122122022230.

The previous prime is 111122122022099. The next prime is 111122122022279. The reversal of 111122122022231 is 132220221221111.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 111122122022231 - 222 = 111122117827927 is a prime.

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

It is a Sophie Germain prime.

It is a junction number, because it is equal to n+sod(n) for n = 111122122022197 and 111122122022206.

It is a congruent number.

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

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

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

Almost surely, 2111122122022231 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 384, while the sum is 23.

Adding to 111122122022231 its reverse (132220221221111), we get a palindrome (243342343243342).

The spelling of 111122122022231 in words is "one hundred eleven trillion, one hundred twenty-two billion, one hundred twenty-two million, twenty-two thousand, two hundred thirty-one".