Search a number
-
+
31025552120093 is a prime number
BaseRepresentation
bin1110000110111101100110…
…00000110101100100011101
311001212000101001221101011102
413003132303000311210131
513031310312320320333
6145552535240202445
76351344050521206
oct703366300654435
9131760331841142
1031025552120093
119981954378a73
123590b62769425
13144090a44477b
1479390521c5ad
1538c0a4923ae8
hex1c37b303591d

31025552120093 has 2 divisors, whose sum is σ = 31025552120094. Its totient is φ = 31025552120092.

The previous prime is 31025552120089. The next prime is 31025552120107. The reversal of 31025552120093 is 39002125552013.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 25987381319524 + 5038170800569 = 5097782^2 + 2244587^2 .

It is a cyclic number.

It is not a de Polignac number, because 31025552120093 - 22 = 31025552120089 is a prime.

It is a super-3 number, since 3×310255521200933 (a number of 41 digits) contains 333 as substring.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 231025552120093 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 81000, while the sum is 38.

The spelling of 31025552120093 in words is "thirty-one trillion, twenty-five billion, five hundred fifty-two million, one hundred twenty thousand, ninety-three".