Search a number
-
+
1100201311367 is a prime number
BaseRepresentation
bin10000000000101001000…
…110111011110010000111
310220011210220212110000022
4100000221012323302013
5121011203013430432
62201231524205355
7142326004563104
oct20005106736207
93804726773008
101100201311367
11394657a5a224
1215928723985b
137c996701422
143b37010baab
151d9434b8b12
hex100291bbc87

1100201311367 has 2 divisors, whose sum is σ = 1100201311368. Its totient is φ = 1100201311366.

The previous prime is 1100201311361. The next prime is 1100201311369. The reversal of 1100201311367 is 7631131020011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1100201311367 - 24 = 1100201311351 is a prime.

Together with 1100201311369, 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 (1100201311361) 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, 550100655683 + 550100655684.

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

Almost surely, 21100201311367 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 756, while the sum is 26.

Adding to 1100201311367 its reverse (7631131020011), we get a palindrome (8731332331378).

The spelling of 1100201311367 in words is "one trillion, one hundred billion, two hundred one million, three hundred eleven thousand, three hundred sixty-seven".