Search a number
-
+
13641501301 = 175360724943
BaseRepresentation
bin11001011010001100…
…01100101001110101
31022012200220001210221
430231012030221311
5210414211020201
610133344414341
7662022563551
oct145506145165
938180801727
1013641501301
1158702a991a
1227886173b1
13139526b57c
14935a36861
1554c91b4a1
hex32d18ca75

13641501301 has 16 divisors (see below), whose sum is σ = 14741305344. Its totient is φ = 12575556864.

The previous prime is 13641501287. The next prime is 13641501329. The reversal of 13641501301 is 10310514631.

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

It is a cyclic number.

It is not a de Polignac number, because 13641501301 - 213 = 13641493109 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (13641505301) 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 in 15 ways as a sum of consecutive naturals, for example, 534436 + ... + 559378.

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

Almost surely, 213641501301 is an apocalyptic number.

It is an amenable number.

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

13641501301 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 25620.

The product of its (nonzero) digits is 1080, while the sum is 25.

The spelling of 13641501301 in words is "thirteen billion, six hundred forty-one million, five hundred one thousand, three hundred one".

Divisors: 1 17 53 607 901 10319 24943 32171 424031 546907 1321979 15140401 22473643 257386817 802441253 13641501301