Search a number
-
+
32111132211023 is a prime number
BaseRepresentation
bin1110100110100011101001…
…01000001111011101001111
311012200210110000101212100212
413103101310220033131033
513202102044321223043
6152143352301113035
76522644535165425
oct723216450173517
9135623400355325
1032111132211023
11a260288aa7938
12372742925877b
1314bc0b391b668
147d0289545115
153aa43e499018
hex1d3474a0f74f

32111132211023 has 2 divisors, whose sum is σ = 32111132211024. Its totient is φ = 32111132211022.

The previous prime is 32111132210987. The next prime is 32111132211061. The reversal of 32111132211023 is 32011223111123.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 32111132211023 - 26 = 32111132210959 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 32111132211023.

It is a congruent number.

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

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

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

Almost surely, 232111132211023 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 432, while the sum is 23.

Adding to 32111132211023 its reverse (32011223111123), we get a palindrome (64122355322146).

The spelling of 32111132211023 in words is "thirty-two trillion, one hundred eleven billion, one hundred thirty-two million, two hundred eleven thousand, twenty-three".