Search a number
-
+
12110013300001 is a prime number
BaseRepresentation
bin1011000000111001010100…
…0010100111110100100001
31120212201001122111210100011
42300032111002213310201
53041402301401100001
641431132512524521
72356630263435331
oct260162502476441
946781048453304
1012110013300001
113949911889451
121437002b50741
1369ac7a8953c6
142dc1b08650c1
15160021293d51
hexb03950a7d21

12110013300001 has 2 divisors, whose sum is σ = 12110013300002. Its totient is φ = 12110013300000.

The previous prime is 12110013299987. The next prime is 12110013300113. The reversal of 12110013300001 is 10000331001121.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6069699432976 + 6040313867025 = 2463676^2 + 2457705^2 .

It is a cyclic number.

It is not a de Polignac number, because 12110013300001 - 27 = 12110013299873 is a prime.

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

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

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

Almost surely, 212110013300001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 12110013300001 its reverse (10000331001121), we get a palindrome (22110344301122).

The spelling of 12110013300001 in words is "twelve trillion, one hundred ten billion, thirteen million, three hundred thousand, one".