Search a number
-
+
13601022565 = 513209246501
BaseRepresentation
bin11001010101010111…
…10010001001100101
31022002212201112102111
430222223302021211
5210323330210230
610125341041021
7661021533004
oct145253621145
938085645374
1013601022565
11584a471619
122776b56171
131389a67b60
149304dac3b
155490c292a
hex32aaf2265

13601022565 has 8 divisors (see below), whose sum is σ = 17576706168. Its totient is φ = 10043832000.

The previous prime is 13601022557. The next prime is 13601022571. The reversal of 13601022565 is 56522010631.

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

It can be written as a sum of positive squares in 4 ways, for example, as 1483636324 + 12117386241 = 38518^2 + 110079^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 13601022565 - 23 = 13601022557 is a prime.

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 104623186 + ... + 104623315.

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

Almost surely, 213601022565 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 209246519.

The product of its (nonzero) digits is 10800, while the sum is 31.

The spelling of 13601022565 in words is "thirteen billion, six hundred one million, twenty-two thousand, five hundred sixty-five".

Divisors: 1 5 13 65 209246501 1046232505 2720204513 13601022565