Search a number
-
+
2133132213013 is a prime number
BaseRepresentation
bin11111000010101000100…
…101100111101100010101
321112220222122121000002021
4133002220211213230111
5234422123321304023
64311540350213141
7310054001433544
oct37025045475425
97486878530067
102133132213013
11752724583a0a
122a54b97b41b1
131261cc332289
147535bd3a15b
153a74acee35d
hex1f0a8967b15

2133132213013 has 2 divisors, whose sum is σ = 2133132213014. Its totient is φ = 2133132213012.

The previous prime is 2133132213011. The next prime is 2133132213031. The reversal of 2133132213013 is 3103122313312.

Together with next prime (2133132213031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2027300411889 + 105831801124 = 1423833^2 + 325318^2 .

It is a cyclic number.

It is not a de Polignac number, because 2133132213013 - 21 = 2133132213011 is a prime.

Together with 2133132213011, it forms a pair of twin primes.

It is a congruent number.

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

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

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

Almost surely, 22133132213013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1944, while the sum is 25.

Adding to 2133132213013 its reverse (3103122313312), we get a palindrome (5236254526325).

The spelling of 2133132213013 in words is "two trillion, one hundred thirty-three billion, one hundred thirty-two million, two hundred thirteen thousand, thirteen".