Search a number
-
+
1102010112211 is a prime number
BaseRepresentation
bin10000000010010100111…
…010111101100011010011
310220100110222110001022011
4100002110322331203103
5121023404042042321
62202131221123351
7142421560254001
oct20022472754323
93810428401264
101102010112211
113953a5a85058
121596b0b59557
137cbc4383298
143b4a2435a71
151d9ec1aeae1
hex10094ebd8d3

1102010112211 has 2 divisors, whose sum is σ = 1102010112212. Its totient is φ = 1102010112210.

The previous prime is 1102010112191. The next prime is 1102010112221. The reversal of 1102010112211 is 1122110102011.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1102010112211 - 229 = 1101473241299 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 1102010112191 and 1102010112200.

It is not a weakly prime, because it can be changed into another prime (1102010112221) by changing a digit.

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

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

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

Almost surely, 21102010112211 is an apocalyptic number.

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

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

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

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

Adding to 1102010112211 its reverse (1122110102011), we get a palindrome (2224120214222).

The spelling of 1102010112211 in words is "one trillion, one hundred two billion, ten million, one hundred twelve thousand, two hundred eleven".