Search a number
-
+
12212011102013 is a prime number
BaseRepresentation
bin1011000110110101010010…
…0101010110111100111101
31121020110100001100222201222
42301231110211112330331
53100040144320231023
641550042003443125
72400201006442442
oct261552445267475
947213301328658
1012212011102013
1139890a299a798
1214529299864a5
136a778425c8c8
143030c8d6b9c9
151629e0aa9cc8
hexb1b54956f3d

12212011102013 has 2 divisors, whose sum is σ = 12212011102014. Its totient is φ = 12212011102012.

The previous prime is 12212011102001. The next prime is 12212011102019. The reversal of 12212011102013 is 31020111021221.

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., 11192149448089 + 1019861653924 = 3345467^2 + 1009882^2 .

It is a cyclic number.

It is not a de Polignac number, because 12212011102013 - 218 = 12212010839869 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 212212011102013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 12212011102013 its reverse (31020111021221), we get a palindrome (43232122123234).

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