Search a number
-
+
1122201122201 is a prime number
BaseRepresentation
bin10000010101001000011…
…001100011010110011001
310222021121010101121222222
4100111020121203112121
5121341231441402301
62215310532353425
7144035122103225
oct20251031432631
93867533347888
101122201122201
113a2a17306775
121615a6a75875
1381a914b8283
143c459c3d785
151e2ceaab31b
hex10548663599

1122201122201 has 2 divisors, whose sum is σ = 1122201122202. Its totient is φ = 1122201122200.

The previous prime is 1122201122131. The next prime is 1122201122213. The reversal of 1122201122201 is 1022211022211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1120760995600 + 1440126601 = 1058660^2 + 37949^2 .

It is a cyclic number.

It is not a de Polignac number, because 1122201122201 - 226 = 1122134013337 is a prime.

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

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

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

Almost surely, 21122201122201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 64, while the sum is 17.

Adding to 1122201122201 its reverse (1022211022211), we get a palindrome (2144412144412).

The spelling of 1122201122201 in words is "one trillion, one hundred twenty-two billion, two hundred one million, one hundred twenty-two thousand, two hundred one".