Search a number
-
+
1101011100997 is a prime number
BaseRepresentation
bin10000000001011001011…
…000000010010101000101
310220020220100122000112211
4100001121120002111011
5121014332320212442
62201444132543421
7142355036641603
oct20013130022505
93806810560484
101101011100997
11394a33077155
12159472481b71
137ca954011a2
143b4098a4873
151d98e626617
hex10059602545

1101011100997 has 2 divisors, whose sum is σ = 1101011100998. Its totient is φ = 1101011100996.

The previous prime is 1101011100961. The next prime is 1101011101007. The reversal of 1101011100997 is 7990011101011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 987825283236 + 113185817761 = 993894^2 + 336431^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101011100997 - 211 = 1101011098949 is a prime.

It is a super-2 number, since 2×11010111009972 (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 (1101011100907) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 21101011100997 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1101011100997 in words is "one trillion, one hundred one billion, eleven million, one hundred thousand, nine hundred ninety-seven".