Search a number
-
+
13909155501173 is a prime number
BaseRepresentation
bin1100101001100111101001…
…0001011101010001110101
31211020200221221222021000212
43022121322101131101311
53310341422302014143
645325440002115205
72633621561014232
oct312317221352165
954220857867025
1013909155501173
114482926740089
12168783004bb05
1379b82119b62a
143612c7340789
15191c20859918
hexca67a45d475

13909155501173 has 2 divisors, whose sum is σ = 13909155501174. Its totient is φ = 13909155501172.

The previous prime is 13909155501133. The next prime is 13909155501179. The reversal of 13909155501173 is 37110555190931.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12144235280164 + 1764920221009 = 3484858^2 + 1328503^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×139091555011732 (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 (13909155501179) by changing a digit.

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

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

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

Almost surely, 213909155501173 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 637875, while the sum is 50.

The spelling of 13909155501173 in words is "thirteen trillion, nine hundred nine billion, one hundred fifty-five million, five hundred one thousand, one hundred seventy-three".