Search a number
-
+
132656331530551 is a prime number
BaseRepresentation
bin11110001010011001110101…
…100001001010000100110111
3122101200211011211102102221111
4132022121311201022010313
5114341420131332434201
61150045251041255451
736641050363160203
oct3612316541120467
9571624154372844
10132656331530551
11392a5263895234
1212a65829034587
13590359119cb4a
1424a885a491b03
151050a67a5cb51
hex78a67584a137

132656331530551 has 2 divisors, whose sum is σ = 132656331530552. Its totient is φ = 132656331530550.

The previous prime is 132656331530539. The next prime is 132656331530587. The reversal of 132656331530551 is 155035133656231.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 132656331530551 - 25 = 132656331530519 is a prime.

It is a super-3 number, since 3×1326563315305513 (a number of 43 digits) contains 333 as substring.

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

It is a congruent number.

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

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

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

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

Almost surely, 2132656331530551 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3645000, while the sum is 49.

The spelling of 132656331530551 in words is "one hundred thirty-two trillion, six hundred fifty-six billion, three hundred thirty-one million, five hundred thirty thousand, five hundred fifty-one".