Search a number
-
+
110331200023169 is a prime number
BaseRepresentation
bin11001000101100001111011…
…111111000010101010000001
3112110122120010000211012112212
4121011201323333002222001
5103430131244201220134
61030353241545431505
732145110663333666
oct3105417377025201
9473576100735485
10110331200023169
11321782210a2704
121045ab1379b595
134974258c97028
141d360b6a25a6d
15cb4e7b03cbce
hex64587bfc2a81

110331200023169 has 2 divisors, whose sum is σ = 110331200023170. Its totient is φ = 110331200023168.

The previous prime is 110331200023127. The next prime is 110331200023189. The reversal of 110331200023169 is 961320002133011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 70220042467600 + 40111157555569 = 8379740^2 + 6333337^2 .

It is a cyclic number.

It is not a de Polignac number, because 110331200023169 - 240 = 109231688395393 is a prime.

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

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

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

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

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

Almost surely, 2110331200023169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5832, while the sum is 32.

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