Search a number
-
+
110011010051 is a prime number
BaseRepresentation
bin110011001110100101…
…0101100110000000011
3101111221212010100022202
41212131022230300003
53300300304310201
6122312141423415
710643114104505
oct1463512546003
9344855110282
10110011010051
1142723390128
12193a256ab6b
13a4b2883427
14547884bd75
152cdd06ec6b
hex199d2acc03

110011010051 has 2 divisors, whose sum is σ = 110011010052. Its totient is φ = 110011010050.

The previous prime is 110011010009. The next prime is 110011010063. The reversal of 110011010051 is 150010110011.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-110011010051 is a prime.

It is a Sophie Germain prime.

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

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

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

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

Almost surely, 2110011010051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 5, while the sum is 11.

Adding to 110011010051 its reverse (150010110011), we get a palindrome (260021120062).

The spelling of 110011010051 in words is "one hundred ten billion, eleven million, ten thousand, fifty-one".