Search a number
-
+
132012000137 is a prime number
BaseRepresentation
bin111101011110010000…
…1110100001110001001
3110121202010212102221102
41322330201310032021
54130330033001022
6140351231151145
712352244325653
oct1727441641611
9417663772842
10132012000137
1150a93372666
12217026754b5
13c5aa990c64
1465647a96d3
1536797e6a92
hex1ebc874389

132012000137 has 2 divisors, whose sum is σ = 132012000138. Its totient is φ = 132012000136.

The previous prime is 132012000083. The next prime is 132012000139. The reversal of 132012000137 is 731000210231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 129759168841 + 2252831296 = 360221^2 + 47464^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 132012000137 - 216 = 132011934601 is a prime.

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

It is a Chen prime.

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

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

Almost surely, 2132012000137 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 132012000137 its reverse (731000210231), we get a palindrome (863012210368).

The spelling of 132012000137 in words is "one hundred thirty-two billion, twelve million, one hundred thirty-seven", and thus it is an aban number.