Search a number
-
+
1100199205969 is a prime number
BaseRepresentation
bin10000000000101000111…
…110111001110001010001
310220011210202220110221121
4100000220332321301101
5121011201444042334
62201231411122241
7142325650643653
oct20005076716121
93804722813847
101100199205969
11394656851426
121592865a3381
137c996145026
143b36db206d3
151d9431eedb4
hex10028fb9c51

1100199205969 has 2 divisors, whose sum is σ = 1100199205970. Its totient is φ = 1100199205968.

The previous prime is 1100199205961. The next prime is 1100199205981. The reversal of 1100199205969 is 9695029910011.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 920179747600 + 180019458369 = 959260^2 + 424287^2 .

It is a cyclic number.

It is not a de Polignac number, because 1100199205969 - 23 = 1100199205961 is a prime.

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

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

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

Almost surely, 21100199205969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 393660, while the sum is 52.

The spelling of 1100199205969 in words is "one trillion, one hundred billion, one hundred ninety-nine million, two hundred five thousand, nine hundred sixty-nine".