Search a number
-
+
1212011010013 is a prime number
BaseRepresentation
bin10001101000110001011…
…111000101011111011101
311021212102010112122020011
4101220301133011133131
5124324144304310023
62324442402123221
7153364522413646
oct21506137053735
94255363478204
101212011010013
11428013688751
12176a90050511
138a3a4b05a1b
14429397b06cd
15217d93d350d
hex11a317c57dd

1212011010013 has 2 divisors, whose sum is σ = 1212011010014. Its totient is φ = 1212011010012.

The previous prime is 1212011009999. The next prime is 1212011010019. The reversal of 1212011010013 is 3100101102121.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1173727391769 + 38283618244 = 1083387^2 + 195662^2 .

It is a cyclic number.

It is not a de Polignac number, because 1212011010013 - 29 = 1212011009501 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21212011010013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1212011010013 its reverse (3100101102121), we get a palindrome (4312112112134).

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