Search a number
-
+
132311302030013 is a prime number
BaseRepresentation
bin11110000101011000100000…
…001010000100001010111101
3122100110211121010112210000012
4132011120200022010022331
5114320242021304430023
61145222550101513005
736604114256621051
oct3605304012041275
9570424533483005
10132311302030013
11391819a9713787
1212a0a997412765
1358a9b96301582
142495c88c01c61
151046ac2084978
hex7856202842bd

132311302030013 has 2 divisors, whose sum is σ = 132311302030014. Its totient is φ = 132311302030012.

The previous prime is 132311302029997. The next prime is 132311302030067. The reversal of 132311302030013 is 310030203113231.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 123417057518329 + 8894244511684 = 11109323^2 + 2982322^2 .

It is a cyclic number.

It is not a de Polignac number, because 132311302030013 - 24 = 132311302029997 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2132311302030013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 23.

Adding to 132311302030013 its reverse (310030203113231), we get a palindrome (442341505143244).

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