Search a number
-
+
132033512103113 is a prime number
BaseRepresentation
bin11110000001010101110010…
…100101100101110011001001
3122022111021120110210100212002
4132001111302211211303021
5114301214113044244423
61144451205203400345
736545051341324205
oct3601256245456311
9568437513710762
10132033512103113
11390851095260a5
1212984b900830b5
1358899259c7b6a
1424866556c5b05
15103e76469d228
hex781572965cc9

132033512103113 has 2 divisors, whose sum is σ = 132033512103114. Its totient is φ = 132033512103112.

The previous prime is 132033512103019. The next prime is 132033512103133. The reversal of 132033512103113 is 311301215330231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 80194836894649 + 51838675208464 = 8955157^2 + 7199908^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-132033512103113 is a prime.

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

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

Almost surely, 2132033512103113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4860, while the sum is 29.

Adding to 132033512103113 its reverse (311301215330231), we get a palindrome (443334727433344).

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