Search a number
-
+
13011432565 = 543101599191
BaseRepresentation
bin11000001111000101…
…01011010001110101
31020120210022020222211
430013202223101311
5203121411320230
65551040053421
7640302231505
oct140742532165
936523266884
1013011432565
11557768395a
122631604271
1312c4875631
148b60a3a05
1551245e42a
hex3078ab475

13011432565 has 16 divisors (see below), whose sum is σ = 16135042176. Its totient is φ = 10066392000.

The previous prime is 13011432563. The next prime is 13011432571. The reversal of 13011432565 is 56523411031.

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

It is not a de Polignac number, because 13011432565 - 21 = 13011432563 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 (13011432563) 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, 277881 + ... + 321310.

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

Almost surely, 213011432565 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 599340.

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

Adding to 13011432565 its reverse (56523411031), we get a palindrome (69534843596).

The spelling of 13011432565 in words is "thirteen billion, eleven million, four hundred thirty-two thousand, five hundred sixty-five".

Divisors: 1 5 43 101 215 505 4343 21715 599191 2995955 25765213 60518291 128826065 302591455 2602286513 13011432565