Search a number
-
+
12012122100053 is a prime number
BaseRepresentation
bin1010111011001100101001…
…0001010101000101010101
31120112100101102221120221002
42232303022101111011111
53033301311224200203
641314143120433045
72346563404115045
oct256631221250525
946470342846832
1012012122100053
113911348852009
121420043478785
13691979c3515a
142d7565901725
1515c6e225dd88
hexaecca455155

12012122100053 has 2 divisors, whose sum is σ = 12012122100054. Its totient is φ = 12012122100052.

The previous prime is 12012122099947. The next prime is 12012122100059. The reversal of 12012122100053 is 35000122121021.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10345113169924 + 1667008930129 = 3216382^2 + 1291127^2 .

It is a cyclic number.

It is not a de Polignac number, because 12012122100053 - 220 = 12012121051477 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

Almost surely, 212012122100053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 240, while the sum is 20.

Adding to 12012122100053 its reverse (35000122121021), we get a palindrome (47012244221074).

The spelling of 12012122100053 in words is "twelve trillion, twelve billion, one hundred twenty-two million, one hundred thousand, fifty-three".