Search a number
-
+
110154087041 is a prime number
BaseRepresentation
bin110011010010110110…
…0011111101010000001
3101112022211100102001112
41212211230133222001
53301043421241131
6122334252213105
710646502201545
oct1464554375201
9345284312045
10110154087041
1142797123a79
121942246a195
13a5063ca17b
14548d853a25
152cea8d302b
hex19a5b1fa81

110154087041 has 2 divisors, whose sum is σ = 110154087042. Its totient is φ = 110154087040.

The previous prime is 110154087011. The next prime is 110154087049. The reversal of 110154087041 is 140780451011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102826042225 + 7328044816 = 320665^2 + 85604^2 .

It is a cyclic number.

It is not a de Polignac number, because 110154087041 - 218 = 110153824897 is a prime.

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

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

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

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

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

Almost surely, 2110154087041 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 110154087041 in words is "one hundred ten billion, one hundred fifty-four million, eighty-seven thousand, forty-one".