Search a number
-
+
132151313062313 is a prime number
BaseRepresentation
bin11110000011000011100000…
…000100100101100110101001
3122022220112122020002010110222
4132003003200010211212221
5114310131342120443223
61145021250343015425
736556421506054016
oct3603034004454651
9568815566063428
10132151313062313
113912006a056326
12129a398743a575
135897a7a42834c
14248c22c96070d
15104285b5760c8
hex7830e01259a9

132151313062313 has 2 divisors, whose sum is σ = 132151313062314. Its totient is φ = 132151313062312.

The previous prime is 132151313062283. The next prime is 132151313062333. The reversal of 132151313062313 is 313260313151231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 112277165672464 + 19874147389849 = 10596092^2 + 4458043^2 .

It is an emirp because it is prime and its reverse (313260313151231) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 132151313062313 - 220 = 132151312013737 is a prime.

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

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

Almost surely, 2132151313062313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 29160, while the sum is 35.

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