Search a number
-
+
1220112110219 is a prime number
BaseRepresentation
bin10001110000010100010…
…110010101001010001011
311022122022201012011112112
4101300110112111022023
5124442242200011334
62332302312532535
7154102341550622
oct21602426251213
94278281164475
101220112110219
114304a0529192
121785710b114b
138b096286342
14430a76746b9
1521b106ee4ce
hex11c1459528b

1220112110219 has 2 divisors, whose sum is σ = 1220112110220. Its totient is φ = 1220112110218.

The previous prime is 1220112110209. The next prime is 1220112110233. The reversal of 1220112110219 is 9120112110221.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1220112110219 - 28 = 1220112109963 is a prime.

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

It is a Sophie Germain prime.

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

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

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

Almost surely, 21220112110219 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 144, while the sum is 23.

It can be divided in two parts, 1220112 and 110219, that added together give a palindrome (1330331).

The spelling of 1220112110219 in words is "one trillion, two hundred twenty billion, one hundred twelve million, one hundred ten thousand, two hundred nineteen".