Search a number
-
+
13012114431149 is a prime number
BaseRepresentation
bin1011110101011001111001…
…1101010101110010101101
31201001221112121221101122122
42331112132131111302231
53201142302243244044
643401403254522325
72512044216513551
oct275263635256255
951057477841578
1013012114431149
11416745240a169
121561a029663a5
13735063747182
1432db0ad0d861
1517871ceacdee
hexbd59e755cad

13012114431149 has 2 divisors, whose sum is σ = 13012114431150. Its totient is φ = 13012114431148.

The previous prime is 13012114431089. The next prime is 13012114431157. The reversal of 13012114431149 is 94113441121031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12662082457924 + 350031973225 = 3558382^2 + 591635^2 .

It is a cyclic number.

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

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 213012114431149 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10368, while the sum is 35.

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