Search a number
-
+
32110341240223 is a prime number
BaseRepresentation
bin1110100110100010001010…
…11110111011010110011111
311012200201101220001101102001
413103101011132323112133
513202043434324141343
6152143142003543131
76522616122066211
oct723210536732637
9135621356041361
1032110341240223
11a25aa12573864
12372724838aaa7
1314bbcb8aaa4bc
147d021248a5b1
153aa3e4d0744d
hex1d34457bb59f

32110341240223 has 2 divisors, whose sum is σ = 32110341240224. Its totient is φ = 32110341240222.

The previous prime is 32110341240167. The next prime is 32110341240251. The reversal of 32110341240223 is 32204214301123.

It is an a-pointer prime, because the next prime (32110341240251) can be obtained adding 32110341240223 to its sum of digits (28).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 32110341240223 - 229 = 32109804369311 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 232110341240223 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6912, while the sum is 28.

Adding to 32110341240223 its reverse (32204214301123), we get a palindrome (64314555541346).

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