Search a number
-
+
13301502013369 is a prime number
BaseRepresentation
bin1100000110001111111101…
…0011010110111110111001
31202002121111112201202000101
43001203333103112332321
53220412434003411434
644142343051035401
72542000422415543
oct301437723267671
952077445652011
1013301502013369
114269154131959
1215a9b0613bb61
13756431a3281b
1433db20832693
15181008b3bb14
hexc18ff4d6fb9

13301502013369 has 2 divisors, whose sum is σ = 13301502013370. Its totient is φ = 13301502013368.

The previous prime is 13301502013337. The next prime is 13301502013421. The reversal of 13301502013369 is 96331020510331.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9189610284969 + 4111891728400 = 3031437^2 + 2027780^2 .

It is an emirp because it is prime and its reverse (96331020510331) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 13301502013369 - 25 = 13301502013337 is a prime.

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

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

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

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

Almost surely, 213301502013369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 43740, while the sum is 37.

The spelling of 13301502013369 in words is "thirteen trillion, three hundred one billion, five hundred two million, thirteen thousand, three hundred sixty-nine".