Search a number
-
+
13401042562997 is a prime number
BaseRepresentation
bin1100001100000010110001…
…1000011010111110110101
31202110010102200211120211122
43003000230120122332311
53224030313344003442
644300204242313325
72552123220214565
oct303005430327665
952403380746748
1013401042562997
1142a7394187101
121605266058845
137629362b6c2b
14344884854da5
151838d286cdd2
hexc302c61afb5

13401042562997 has 2 divisors, whose sum is σ = 13401042562998. Its totient is φ = 13401042562996.

The previous prime is 13401042562979. The next prime is 13401042563003. The reversal of 13401042562997 is 79926524010431.

Together with previous prime (13401042562979) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8096722284676 + 5304320278321 = 2845474^2 + 2303111^2 .

It is a cyclic number.

It is not a de Polignac number, because 13401042562997 - 218 = 13401042300853 is a prime.

It is a congruent number.

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

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

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

Almost surely, 213401042562997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3265920, while the sum is 53.

The spelling of 13401042562997 in words is "thirteen trillion, four hundred one billion, forty-two million, five hundred sixty-two thousand, nine hundred ninety-seven".