Search a number
-
+
1102000111001 is a prime number
BaseRepresentation
bin10000000010010100010…
…100110011110110011001
310220100110021121221012222
4100002110110303312121
5121023344012023001
62202130222513425
7142421406250646
oct20022424636631
93810407557188
101102000111001
113953a0373a99
121596a9735875
137cbc2290cca
143b4a0d90dcd
151d9eb38661b
hex10094533d99

1102000111001 has 2 divisors, whose sum is σ = 1102000111002. Its totient is φ = 1102000111000.

The previous prime is 1102000110973. The next prime is 1102000111033. The reversal of 1102000111001 is 1001110002011.

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., 1067987899225 + 34012211776 = 1033435^2 + 184424^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1102000111001 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1102000111001.

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

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

Almost surely, 21102000111001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2, while the sum is 8.

Adding to 1102000111001 its reverse (1001110002011), we get a palindrome (2103110113012).

The spelling of 1102000111001 in words is "one trillion, one hundred two billion, one hundred eleven thousand, one".