Search a number
-
+
13521111051 = 371813557251
BaseRepresentation
bin11001001011110101…
…11100100000001011
31021220022100121102210
430211322330200023
5210142401023201
610113404200203
7656031355560
oct144572744013
937808317383
1013521111051
115809350948
122754239063
131376338b36
14923a58867
1554208a1d6
hex325ebc80b

13521111051 has 16 divisors (see below), whose sum is σ = 20717435648. Its totient is φ = 7683660000.

The previous prime is 13521111031. The next prime is 13521111053. The reversal of 13521111051 is 15011112531.

13521111051 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 13521111051 - 219 = 13520586763 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (21).

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

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

Almost surely, 213521111051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3557442.

The product of its (nonzero) digits is 150, while the sum is 21.

Adding to 13521111051 its reverse (15011112531), we get a palindrome (28532223582).

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

Divisors: 1 3 7 21 181 543 1267 3801 3557251 10671753 24900757 74702271 643862431 1931587293 4507037017 13521111051