Search a number
-
+
13041047657377 is a prime number
BaseRepresentation
bin1011110111000101101100…
…0000110101101110100001
31201011201020000220120112001
42331301123000311232201
53202131031200014002
643422550302204001
72514120214053025
oct275613300655641
951151200816461
1013041047657377
11417874a472283
121567538583601
137379c4ac2b8c
143312937c8385
15179363115a87
hexbdc5b035ba1

13041047657377 has 2 divisors, whose sum is σ = 13041047657378. Its totient is φ = 13041047657376.

The previous prime is 13041047657321. The next prime is 13041047657381. The reversal of 13041047657377 is 77375674014031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12126545617761 + 914502039616 = 3482319^2 + 956296^2 .

It is a cyclic number.

It is not a de Polignac number, because 13041047657377 - 227 = 13040913439649 is a prime.

It is not a weakly prime, because it can be changed into another prime (13041047657177) 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, 6520523828688 + 6520523828689.

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

Almost surely, 213041047657377 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10372320, while the sum is 55.

The spelling of 13041047657377 in words is "thirteen trillion, forty-one billion, forty-seven million, six hundred fifty-seven thousand, three hundred seventy-seven".