Search a number
-
+
1000110100151 is a prime number
BaseRepresentation
bin11101000110110110011…
…01010000111010110111
310112121110101121002111102
432203123031100322313
5112341211141201101
62043235542200315
7132153442405511
oct16433315207267
93477411532442
101000110100151
11356165095858
121419b2a2309b
1373405037666
1436596d06bb1
151b03626386b
hexe8db350eb7

1000110100151 has 2 divisors, whose sum is σ = 1000110100152. Its totient is φ = 1000110100150.

The previous prime is 1000110100139. The next prime is 1000110100153. The reversal of 1000110100151 is 1510010110001.

It is a happy number.

It is a strong prime.

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

It is a cyclic number.

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

Together with 1000110100153, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 21000110100151 is an apocalyptic number.

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

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

1000110100151 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 1000110100151 its reverse (1510010110001), we get a palindrome (2510120210152).

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