Search a number
-
+
13041049981 is a prime number
BaseRepresentation
bin11000010010100111…
…01010000101111101
31020122212000222110011
430021103222011331
5203202002044411
65554014543221
7641112044611
oct141123520575
936585028404
1013041049981
115592372963
12263b507b11
1312caa4542b
148b9db3341
15514d5ec21
hex3094ea17d

13041049981 has 2 divisors, whose sum is σ = 13041049982. Its totient is φ = 13041049980.

The previous prime is 13041049913. The next prime is 13041050053. The reversal of 13041049981 is 18994014031.

13041049981 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12851849956 + 189200025 = 113366^2 + 13755^2 .

It is a cyclic number.

It is not a de Polignac number, because 13041049981 - 211 = 13041047933 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 213041049981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 31104, while the sum is 40.

The spelling of 13041049981 in words is "thirteen billion, forty-one million, forty-nine thousand, nine hundred eighty-one".