Search a number
-
+
1101011001127 is a prime number
BaseRepresentation
bin10000000001011001010…
…111101001111100100111
310220020220100102221112221
4100001121113221330213
5121014332304014002
62201444130453211
7142355036044462
oct20013127517447
93806810387487
101101011001127
11394a33009114
12159472434207
137ca953978ab
143b40987a2d9
151d98e606c37
hex100595e9f27

1101011001127 has 2 divisors, whose sum is σ = 1101011001128. Its totient is φ = 1101011001126.

The previous prime is 1101011001067. The next prime is 1101011001143. The reversal of 1101011001127 is 7211001101011.

It is an a-pointer prime, because the next prime (1101011001143) can be obtained adding 1101011001127 to its sum of digits (16).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1101011001127 - 215 = 1101010968359 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21101011001127 is an apocalyptic number.

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

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

1101011001127 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 14, while the sum is 16.

Adding to 1101011001127 its reverse (7211001101011), we get a palindrome (8312012102138).

The spelling of 1101011001127 in words is "one trillion, one hundred one billion, eleven million, one thousand, one hundred twenty-seven".