Search a number
-
+
32109804369311 is a prime number
BaseRepresentation
bin1110100110100001001010…
…11110111011010110011111
311012200200000110211111222012
413103100211132323112133
513202041334404304221
6152143012424541435
76522566612545664
oct723204536732637
9135620013744865
1032109804369311
11a25a767513799
12372711862187b
1314bbc317b5bc6
147d01a1057a6b
153aa3b2b0965b
hex1d34257bb59f

32109804369311 has 2 divisors, whose sum is σ = 32109804369312. Its totient is φ = 32109804369310.

The previous prime is 32109804369287. The next prime is 32109804369337. The reversal of 32109804369311 is 11396340890123.

It is a weak prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-32109804369311 is a prime.

It is a super-2 number, since 2×321098043693112 (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 32109804369311.

It is a congruent number.

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

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

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

Almost surely, 232109804369311 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 839808, while the sum is 50.

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