Search a number
-
+
1101113311297 is a prime number
BaseRepresentation
bin10000000001011111011…
…101111100000001000001
310220021011110221211201111
4100001133131330001001
5121020040001430142
62201502223403321
7142360420501036
oct20013735740101
93807143854644
101101113311297
11394a8583827a
121594a0753541
137cab0639a5c
143b4192ad38d
151d9985b5e17
hex1005f77c041

1101113311297 has 2 divisors, whose sum is σ = 1101113311298. Its totient is φ = 1101113311296.

The previous prime is 1101113311279. The next prime is 1101113311313. The reversal of 1101113311297 is 7921133111011.

Together with previous prime (1101113311279) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 900280266561 + 200833044736 = 948831^2 + 448144^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101113311297 - 211 = 1101113309249 is a prime.

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

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

Almost surely, 21101113311297 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1134, while the sum is 31.

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