Search a number
-
+
110231517119951 is a prime number
BaseRepresentation
bin11001000100000101000110…
…011010111100010111001111
3112110022000210221212001022102
4121010011012122330113033
5103422013121340314301
61030235354311105315
732134651516542623
oct3104050632742717
9473260727761272
10110231517119951
1132139a18759067
121044373407223b
134967a31090226
141d3133bb49183
15cb2594a8cb6b
hex6441466bc5cf

110231517119951 has 2 divisors, whose sum is σ = 110231517119952. Its totient is φ = 110231517119950.

The previous prime is 110231517119891. The next prime is 110231517119959. The reversal of 110231517119951 is 159911715132011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110231517119951 - 222 = 110231512925647 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2110231517119951 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 85050, while the sum is 47.

The spelling of 110231517119951 in words is "one hundred ten trillion, two hundred thirty-one billion, five hundred seventeen million, one hundred nineteen thousand, nine hundred fifty-one".