Search a number
-
+
32130121311131 is a prime number
BaseRepresentation
bin1110100111000111000000…
…11101111010001110011011
311012202121110101202002122212
413103203200131322032123
513202404442023424011
6152200212435305335
76524216233653344
oct723434035721633
9135677411662585
1032130121311131
11a2683429388a8
12372b04874b24b
1314c0b1ba40a7c
147d116b4830cb
153aaba15ce08b
hex1d38e077a39b

32130121311131 has 2 divisors, whose sum is σ = 32130121311132. Its totient is φ = 32130121311130.

The previous prime is 32130121311107. The next prime is 32130121311137. The reversal of 32130121311131 is 13111312103123.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 32130121311131 - 222 = 32130117116827 is a prime.

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

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

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

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

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

Almost surely, 232130121311131 is an apocalyptic number.

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

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

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

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

Adding to 32130121311131 its reverse (13111312103123), we get a palindrome (45241433414254).

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