Search a number
-
+
114331431439013 is a prime number
BaseRepresentation
bin11001111111101111011100…
…010110111000101010100101
3112222210222102000222001100012
4121333233130112320222211
5104441201232422022023
61043055045015500005
733040113311340635
oct3177573426705245
9488728360861305
10114331431439013
113347a762484438
12109a6245087605
134ba453b9c92c9
1420339569a46c5
15d340524aa978
hex67fbdc5b8aa5

114331431439013 has 2 divisors, whose sum is σ = 114331431439014. Its totient is φ = 114331431439012.

The previous prime is 114331431439009. The next prime is 114331431439021. The reversal of 114331431439013 is 310934134133411.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 81952065296644 + 32379366142369 = 9052738^2 + 5690287^2 .

It is a cyclic number.

It is not a de Polignac number, because 114331431439013 - 22 = 114331431439009 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2114331431439013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 139968, while the sum is 41.

The spelling of 114331431439013 in words is "one hundred fourteen trillion, three hundred thirty-one billion, four hundred thirty-one million, four hundred thirty-nine thousand, thirteen".