Base | Representation |
---|---|
bin | 11000100101110110… |
… | …01010100000111101 |
3 | 1021002002122110220110 |
4 | 30102323022200331 |
5 | 204014303320331 |
6 | 10022021140233 |
7 | 645111363003 |
oct | 142273124075 |
9 | 37062573813 |
10 | 13202401341 |
11 | 5665458598 |
12 | 268555a679 |
13 | 13252b9ccc |
14 | 8d35b4a73 |
15 | 5240d2946 |
hex | 312eca83d |
13202401341 has 8 divisors (see below), whose sum is σ = 17731692864. Its totient is φ = 8737355360.
The previous prime is 13202401321. The next prime is 13202401357. The reversal of 13202401341 is 14310420231.
13202401341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13202401341 - 219 = 13201877053 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13202401321) 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 7 ways as a sum of consecutive naturals, for example, 16060905 + ... + 16061726.
It is an arithmetic number, because the mean of its divisors is an integer number (2216461608).
Almost surely, 213202401341 is an apocalyptic number.
It is an amenable number.
13202401341 is a deficient number, since it is larger than the sum of its proper divisors (4529291523).
13202401341 is a wasteful number, since it uses less digits than its factorization.
13202401341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32122771.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 13202401341 its reverse (14310420231), we get a palindrome (27512821572).
The spelling of 13202401341 in words is "thirteen billion, two hundred two million, four hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •