Search a number
-
+
1000110010153 is a prime number
BaseRepresentation
bin11101000110110110011…
…00111010111100101001
310112121110101102112001011
432203123030322330221
5112341211130311103
62043235540223521
7132153441552232
oct16433314727451
93477411375034
101000110010153
11356165034181
121419b299aba1
13734050056c7
1436596cc2089
151b036246d6d
hexe8db33af29

1000110010153 has 2 divisors, whose sum is σ = 1000110010154. Its totient is φ = 1000110010152.

The previous prime is 1000110010093. The next prime is 1000110010177. The reversal of 1000110010153 is 3510100110001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 967492566544 + 32617443609 = 983612^2 + 180603^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1000110010153 - 29 = 1000110009641 is a prime.

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

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

Almost surely, 21000110010153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15, while the sum is 13.

Adding to 1000110010153 its reverse (3510100110001), we get a palindrome (4510210120154).

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