Search a number
-
+
1311101011133 is a prime number
BaseRepresentation
bin10011000101000011101…
…101011100010010111101
311122100011212212020200122
4103011003231130102331
5132440113324324013
62442151140504325
7163503206500334
oct23050355342275
94570155766618
101311101011133
11466042382161
121921250ab0a5
1396836c2a894
1447659a30d1b
15241887b8a08
hex13143b5c4bd

1311101011133 has 2 divisors, whose sum is σ = 1311101011134. Its totient is φ = 1311101011132.

The previous prime is 1311101011117. The next prime is 1311101011141. The reversal of 1311101011133 is 3311101011131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1159233362329 + 151867648804 = 1076677^2 + 389702^2 .

It is a cyclic number.

It is not a de Polignac number, because 1311101011133 - 24 = 1311101011117 is a prime.

It is a super-2 number, since 2×13111010111332 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

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

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

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

Almost surely, 21311101011133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 17.

Adding to 1311101011133 its reverse (3311101011131), we get a palindrome (4622202022264).

The spelling of 1311101011133 in words is "one trillion, three hundred eleven billion, one hundred one million, eleven thousand, one hundred thirty-three".