Search a number
-
+
13011051355 = 523532134709
BaseRepresentation
bin11000001111000010…
…01110001101011011
31020120202120220001221
430013201032031123
5203121312120410
65551023552511
7640266053221
oct140741161533
936522526057
1013011051355
115577443505
12263145b737
1312c4770c73
148b6004b11
155123d64da
hex30784e35b

13011051355 has 16 divisors (see below), whose sum is σ = 16599504960. Its totient is φ = 9768423808.

The previous prime is 13011051349. The next prime is 13011051359. The reversal of 13011051355 is 55315011031.

It is a happy number.

13011051355 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 13011051355 - 27 = 13011051227 is a prime.

It is not an unprimeable number, because it can be changed into a prime (13011051359) 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, 1061260 + ... + 1073449.

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

Almost surely, 213011051355 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2134790.

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

Adding to 13011051355 its reverse (55315011031), we get a palindrome (68326062386).

The spelling of 13011051355 in words is "thirteen billion, eleven million, fifty-one thousand, three hundred fifty-five".

Divisors: 1 5 23 53 115 265 1219 6095 2134709 10673545 49098307 113139577 245491535 565697885 2602210271 13011051355