Search a number
-
+
32111101213 is a prime number
BaseRepresentation
bin11101111001111110…
…001000010100011101
310001212212200221210221
4131321332020110131
51011230420214323
622430204201341
72214512566612
oct357176102435
9101785627727
1032111101213
1112688974684
126281b39251
13304986bb09
1417a8984509
15c7e13555d
hex779f8851d

32111101213 has 2 divisors, whose sum is σ = 32111101214. Its totient is φ = 32111101212.

The previous prime is 32111101207. The next prime is 32111101229. The reversal of 32111101213 is 31210111123.

It is a happy number.

It is an a-pointer prime, because the next prime (32111101229) can be obtained adding 32111101213 to its sum of digits (16).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 31727803129 + 383298084 = 178123^2 + 19578^2 .

It is a cyclic number.

It is not a de Polignac number, because 32111101213 - 229 = 31574230301 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 232111101213 is an apocalyptic number.

It is an amenable number.

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

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

32111101213 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 36, while the sum is 16.

Adding to 32111101213 its reverse (31210111123), we get a palindrome (63321212336).

The spelling of 32111101213 in words is "thirty-two billion, one hundred eleven million, one hundred one thousand, two hundred thirteen".