Base | Representation |
---|---|
bin | 11000110001111101… |
… | …10010010100100001 |
3 | 1021100011211221102110 |
4 | 30120332302110201 |
5 | 204221311422423 |
6 | 10040051105533 |
7 | 650454153105 |
oct | 143076622441 |
9 | 37304757373 |
10 | 13304014113 |
11 | 5707850795 |
12 | 26b35a22a9 |
13 | 1340376900 |
14 | 902ca5905 |
15 | 52cea5193 |
hex | 318fb2521 |
13304014113 has 48 divisors (see below), whose sum is σ = 19807662336. Its totient is φ = 7933386240.
The previous prime is 13304014099. The next prime is 13304014117. The reversal of 13304014113 is 31141040331.
It is not a de Polignac number, because 13304014113 - 25 = 13304014081 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13304014113.
It is not an unprimeable number, because it can be changed into a prime (13304014117) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5082381 + ... + 5084997.
It is an arithmetic number, because the mean of its divisors is an integer number (412659632).
Almost surely, 213304014113 is an apocalyptic number.
13304014113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13304014113 is a deficient number, since it is larger than the sum of its proper divisors (6503648223).
13304014113 is a wasteful number, since it uses less digits than its factorization.
13304014113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2954 (or 2941 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13304014113 its reverse (31141040331), we get a palindrome (44445054444).
It can be divided in two parts, 133040 and 14113, that added together give a triangular number (147153 = T542).
The spelling of 13304014113 in words is "thirteen billion, three hundred four million, fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •