Search a number
-
+
110231168964283 is a prime number
BaseRepresentation
bin11001000100000100110001…
…101010110101011010111011
3112110021222220200201220112001
4121010010301222311122323
5103422011413223324113
61030235255553001431
732134640061346543
oct3104046152653273
9473258820656461
10110231168964283
113213985a183604
1210443657553277
1349679a6c01663
141d313077dc323
15cb257421a7dd
hex644131ab56bb

110231168964283 has 2 divisors, whose sum is σ = 110231168964284. Its totient is φ = 110231168964282.

The previous prime is 110231168964251. The next prime is 110231168964349. The reversal of 110231168964283 is 382469861132011.

It is a weak prime.

It is an emirp because it is prime and its reverse (382469861132011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 110231168964283 - 25 = 110231168964251 is a prime.

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

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

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

Almost surely, 2110231168964283 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2985984, while the sum is 55.

The spelling of 110231168964283 in words is "one hundred ten trillion, two hundred thirty-one billion, one hundred sixty-eight million, nine hundred sixty-four thousand, two hundred eighty-three".