Search a number
-
+
110011011010151 is a prime number
BaseRepresentation
bin11001000000110111101111…
…001110111000111001100111
3112102111221122111201001102212
4121000313233032320321213
5103404410022304311101
61025550205531554035
732113014256540136
oct3100675716707147
9472457574631385
10110011011010151
1132064453809089
1210408a54bbb91b
13494ccbc582394
141d247c047991d
15cab98b2291bb
hex640def3b8e67

110011011010151 has 2 divisors, whose sum is σ = 110011011010152. Its totient is φ = 110011011010150.

The previous prime is 110011011010111. The next prime is 110011011010157. The reversal of 110011011010151 is 151010110110011.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 110011011010151 - 222 = 110011006815847 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2110011011010151 is an apocalyptic number.

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

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

110011011010151 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 14.

Adding to 110011011010151 its reverse (151010110110011), we get a palindrome (261021121120162).

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