Search a number
-
+
13520015330 = 251352001533
BaseRepresentation
bin11001001011101101…
…10000111111100010
31021220020021221101112
430211312300333202
5210142110442310
610113324503322
7656016143213
oct144566607742
937806257345
1013520015330
115808772698
1227539aab42
131376044193
1492385140a
15541e20705
hex325db0fe2

13520015330 has 8 divisors (see below), whose sum is σ = 24336027612. Its totient is φ = 5408006128.

The previous prime is 13520015329. The next prime is 13520015359. The reversal of 13520015330 is 3351002531.

It can be written as a sum of positive squares in 2 ways, for example, as 13181565721 + 338449609 = 114811^2 + 18397^2 .

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

It is a junction number, because it is equal to n+sod(n) for n = 13520015296 and 13520015305.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 676000757 + ... + 676000776.

Almost surely, 213520015330 is an apocalyptic number.

13520015330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 1352001540.

The product of its (nonzero) digits is 1350, while the sum is 23.

Adding to 13520015330 its reverse (3351002531), we get a palindrome (16871017861).

The spelling of 13520015330 in words is "thirteen billion, five hundred twenty million, fifteen thousand, three hundred thirty".

Divisors: 1 2 5 10 1352001533 2704003066 6760007665 13520015330