Search a number
-
+
1100021011997 is a prime number
BaseRepresentation
bin10000000000011110010…
…111001001011000011101
310220011100100121021202212
4100000132113021120131
5121010320334340442
62201202003530205
7142321355220005
oct20003627113035
93804310537685
101100021011997
11394575202686
12159236989965
137c9682541cb
143b3541b7005
151d932751a82
hex1001e5c961d

1100021011997 has 2 divisors, whose sum is σ = 1100021011998. Its totient is φ = 1100021011996.

The previous prime is 1100021011979. The next prime is 1100021012011. The reversal of 1100021011997 is 7991101200011.

Together with previous prime (1100021011979) 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., 802755073156 + 297265938841 = 895966^2 + 545221^2 .

It is a cyclic number.

It is not a de Polignac number, because 1100021011997 - 28 = 1100021011741 is a prime.

It is a congruent number.

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

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

Almost surely, 21100021011997 is an apocalyptic number.

It is an amenable number.

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

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

1100021011997 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 32.

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