Search a number
-
+
110200123110331 is a prime number
BaseRepresentation
bin11001000011100111110111…
…001100010011001110111011
3112110012000210001111010020101
4121003213313030103032323
5103421004323004012311
61030213123200340231
732132460532061032
oct3103476714231673
9473160701433211
10110200123110331
1132127678647a71
1210439632314677
134964a99c66187
141d2da0050b719
15cb18588a3ec1
hex6439f73133bb

110200123110331 has 2 divisors, whose sum is σ = 110200123110332. Its totient is φ = 110200123110330.

The previous prime is 110200123110323. The next prime is 110200123110359. The reversal of 110200123110331 is 133011321002011.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 110200123110331 - 23 = 110200123110323 is a prime.

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

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

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

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

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

Almost surely, 2110200123110331 is an apocalyptic number.

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

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

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

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

Adding to 110200123110331 its reverse (133011321002011), we get a palindrome (243211444112342).

The spelling of 110200123110331 in words is "one hundred ten trillion, two hundred billion, one hundred twenty-three million, one hundred ten thousand, three hundred thirty-one".