Search a number
-
+
13320011015 = 516715952109
BaseRepresentation
bin11000110011110111…
…10011110100000111
31021101021221200001022
430121323303310013
5204234410323030
610041422021355
7651040140233
oct143173636407
937337850038
1013320011015
115715887473
1226b8a1785b
131343787c2c
1490506b5c3
1552e5b4de5
hex319ef3d07

13320011015 has 8 divisors (see below), whose sum is σ = 16079726880. Its totient is φ = 10592199712.

The previous prime is 13320011011. The next prime is 13320011027. The reversal of 13320011015 is 51011002331.

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

It is a cyclic number.

It is not a de Polignac number, because 13320011015 - 22 = 13320011011 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (13320011011) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7975220 + ... + 7976889.

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

Almost surely, 213320011015 is an apocalyptic number.

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

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

13320011015 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 15952281.

The product of its (nonzero) digits is 90, while the sum is 17.

Adding to 13320011015 its reverse (51011002331), we get a palindrome (64331013346).

The spelling of 13320011015 in words is "thirteen billion, three hundred twenty million, eleven thousand, fifteen".

Divisors: 1 5 167 835 15952109 79760545 2664002203 13320011015