Search a number
-
+
32132433103261 is a prime number
BaseRepresentation
bin1110100111001011010100…
…10000101100100110011101
311012202211102111210022021121
413103211222100230212131
513202424210333301021
6152201234101130541
76524330434610161
oct723455220544635
9135684374708247
1032132433103261
11a269319883507
12372b5929b9a51
1314c10c99843ca
147d130a500ca1
153aac8952e741
hex1d396a42c99d

32132433103261 has 2 divisors, whose sum is σ = 32132433103262. Its totient is φ = 32132433103260.

The previous prime is 32132433103229. The next prime is 32132433103271. The reversal of 32132433103261 is 16230133423123.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 31871331520900 + 261101582361 = 5645470^2 + 510981^2 .

It is a cyclic number.

It is not a de Polignac number, because 32132433103261 - 25 = 32132433103229 is a prime.

It is a congruent number.

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

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

Almost surely, 232132433103261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 46656, while the sum is 34.

Adding to 32132433103261 its reverse (16230133423123), we get a palindrome (48362566526384).

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