Search a number
-
+
132661644660533 is a prime number
BaseRepresentation
bin11110001010011110110010…
…001101001000111100110101
3122101201022220010000102002102
4132022132302031020330311
5114342012022013114113
61150051530200151445
736641326140061112
oct3612366215107465
9571638803012072
10132661644660533
11392a753aa2444a
1212a66870468585
135903c29b75941
1424a8c01d83909
151050c79218758
hex78a7b2348f35

132661644660533 has 2 divisors, whose sum is σ = 132661644660534. Its totient is φ = 132661644660532.

The previous prime is 132661644660469. The next prime is 132661644660563. The reversal of 132661644660533 is 335066446166231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 127039543677124 + 5622100983409 = 11271182^2 + 2371097^2 .

It is a cyclic number.

It is not a de Polignac number, because 132661644660533 - 26 = 132661644660469 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2132661644660533 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 132661644660533 in words is "one hundred thirty-two trillion, six hundred sixty-one billion, six hundred forty-four million, six hundred sixty thousand, five hundred thirty-three".