Search a number
-
+
132036925507661 is a prime number
BaseRepresentation
bin11110000001011000111110…
…000010101100100001001101
3122022111121101100201021121202
4132001120332002230201031
5114301243110412221121
61144452532020435245
736545232046641026
oct3601307602544115
9568447340637552
10132036925507661
1139086600287499
1212985783248b25
13588a04ac35075
14248689ab81c4d
15103e8b41a240b
hex78163e0ac84d

132036925507661 has 2 divisors, whose sum is σ = 132036925507662. Its totient is φ = 132036925507660.

The previous prime is 132036925507609. The next prime is 132036925507673. The reversal of 132036925507661 is 166705529630231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 131258701598761 + 778223908900 = 11456819^2 + 882170^2 .

It is a cyclic number.

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

It is a junction number, because it is equal to n+sod(n) for n = 132036925507597 and 132036925507606.

It is a congruent number.

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

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

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

Almost surely, 2132036925507661 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12247200, while the sum is 56.

The spelling of 132036925507661 in words is "one hundred thirty-two trillion, thirty-six billion, nine hundred twenty-five million, five hundred seven thousand, six hundred sixty-one".