Search a number
-
+
1122210001013 is a prime number
BaseRepresentation
bin10000010101001000111…
…011011011000001110101
310222021121202002201102212
4100111020323123001311
5121341241230013023
62215311450543205
7144035260423043
oct20251073330165
93867552081385
101122210001013
113a2a21320532
121615a9a37b05
1381a932a66ca
143c45b0b1393
151e2d0761e78
hex10548edb075

1122210001013 has 2 divisors, whose sum is σ = 1122210001014. Its totient is φ = 1122210001012.

The previous prime is 1122210000973. The next prime is 1122210001019. The reversal of 1122210001013 is 3101000122211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 913052869444 + 209157131569 = 955538^2 + 457337^2 .

It is a cyclic number.

It is not a de Polignac number, because 1122210001013 - 212 = 1122209996917 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21122210001013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24, while the sum is 14.

Adding to 1122210001013 its reverse (3101000122211), we get a palindrome (4223210123224).

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