Base | Representation |
---|---|
bin | 11000100101101110… |
… | …00100111111000001 |
3 | 1021002000122001110100 |
4 | 30102313010333001 |
5 | 204014020030423 |
6 | 10021542153013 |
7 | 645066311616 |
oct | 142267047701 |
9 | 37060561410 |
10 | 13201330113 |
11 | 5664896784 |
12 | 2685122769 |
13 | 132500354a |
14 | 8d33b650d |
15 | 523e70343 |
hex | 312dc4fc1 |
13201330113 has 24 divisors (see below), whose sum is σ = 19169092800. Its totient is φ = 8754624864.
The previous prime is 13201330099. The next prime is 13201330133. The reversal of 13201330113 is 31103310231.
It is a happy number.
13201330113 is a `hidden beast` number, since 1 + 320 + 1 + 330 + 1 + 13 = 666.
13201330113 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 13201330113 - 25 = 13201330081 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13201330133) 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 23 ways as a sum of consecutive naturals, for example, 1366183 + ... + 1375811.
It is an arithmetic number, because the mean of its divisors is an integer number (798712200).
Almost surely, 213201330113 is an apocalyptic number.
It is an amenable number.
13201330113 is a deficient number, since it is larger than the sum of its proper divisors (5967762687).
13201330113 is a wasteful number, since it uses less digits than its factorization.
13201330113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10421 (or 10418 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 13201330113 its reverse (31103310231), we get a palindrome (44304640344).
The spelling of 13201330113 in words is "thirteen billion, two hundred one million, three hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •