Search a number
-
+
13044240301331 is a prime number
BaseRepresentation
bin1011110111010001100101…
…0011110011110100010011
31201012000110112102200200102
42331310121103303310103
53202204101004120311
643424235151443015
72514262302064631
oct275643123636423
951160415380612
1013044240301331
11417a0386509a8
12156808982646b
137380b3387405
143314b781a351
1517949d55e43b
hexbdd194f3d13

13044240301331 has 2 divisors, whose sum is σ = 13044240301332. Its totient is φ = 13044240301330.

The previous prime is 13044240301291. The next prime is 13044240301333. The reversal of 13044240301331 is 13310304244031.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 13044240301331 - 210 = 13044240300307 is a prime.

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

Together with 13044240301333, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 213044240301331 is an apocalyptic number.

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

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

13044240301331 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 29.

Adding to 13044240301331 its reverse (13310304244031), we get a palindrome (26354544545362).

The spelling of 13044240301331 in words is "thirteen trillion, forty-four billion, two hundred forty million, three hundred one thousand, three hundred thirty-one".