Search a number
-
+
13406151338959 is a prime number
BaseRepresentation
bin1100001100010101110011…
…1000110110101111001111
31202110121121201220021222011
43003011130320312233033
53224121244220321314
644302411221202051
72552363633125261
oct303053470665717
952417551807864
1013406151338959
1142a9575a2a0a5
121606250b60327
1376326b83c9a2
14344c0b14db31
15183ad110e4c4
hexc315ce36bcf

13406151338959 has 2 divisors, whose sum is σ = 13406151338960. Its totient is φ = 13406151338958.

The previous prime is 13406151338869. The next prime is 13406151338999. The reversal of 13406151338959 is 95983315160431.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 13406151338959 - 223 = 13406142950351 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 213406151338959 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10497600, while the sum is 58.

The spelling of 13406151338959 in words is "thirteen trillion, four hundred six billion, one hundred fifty-one million, three hundred thirty-eight thousand, nine hundred fifty-nine".