Search a number
-
+
132311012120689 is a prime number
BaseRepresentation
bin11110000101011000001110…
…111000001001100001110001
3122100110210211221000212011211
4132011120032320021201301
5114320240423100330224
61145222501224040121
736604104136466263
oct3605301670114161
9570423757025154
10132311012120689
11391818700015a6
1212a0a916303041
1358a9b4b2276ac
142495c5c4d7b33
151046aa68ba894
hex78560ee09871

132311012120689 has 2 divisors, whose sum is σ = 132311012120690. Its totient is φ = 132311012120688.

The previous prime is 132311012120657. The next prime is 132311012120717. The reversal of 132311012120689 is 986021210113231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 130599572552289 + 1711439568400 = 11428017^2 + 1308220^2 .

It is a cyclic number.

It is not a de Polignac number, because 132311012120689 - 25 = 132311012120657 is a prime.

It is a super-2 number, since 2×1323110121206892 (a number of 29 digits) contains 22 as substring.

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

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

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

Almost surely, 2132311012120689 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 31104, while the sum is 40.

The spelling of 132311012120689 in words is "one hundred thirty-two trillion, three hundred eleven billion, twelve million, one hundred twenty thousand, six hundred eighty-nine".