Search a number
-
+
110144891137 is a prime number
BaseRepresentation
bin110011010010100100…
…1011010100100000001
3101112022012001012122111
41212211021122210001
53301034043004022
6122333323135321
710646331061411
oct1464511324401
9345265035574
10110144891137
1142791a12a56
121941b374541
13a50452a5c8
14548c53c641
152ce9bb8477
hex19a525a901

110144891137 has 2 divisors, whose sum is σ = 110144891138. Its totient is φ = 110144891136.

The previous prime is 110144891047. The next prime is 110144891147. The reversal of 110144891137 is 731198441011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 104732493376 + 5412397761 = 323624^2 + 73569^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 110144891137 - 27 = 110144891009 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 110144891137.

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

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

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

Almost surely, 2110144891137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24192, while the sum is 40.

The spelling of 110144891137 in words is "one hundred ten billion, one hundred forty-four million, eight hundred ninety-one thousand, one hundred thirty-seven".