Base | Representation |
---|---|
bin | 1100000000011010110000… |
… | …1010110010100100010001 |
3 | 1201202000220220021002202011 |
4 | 3000012230022302210101 |
5 | 3212242302142312241 |
6 | 44024334251222521 |
7 | 2531523043063345 |
oct | 300065412624421 |
9 | 51660826232664 |
10 | 13201323010321 |
11 | 422a716755156 |
12 | 1592608447a41 |
13 | 749b5810ac24 |
14 | 338d39ad7625 |
15 | 17d5e3d44281 |
hex | c01ac2b2911 |
13201323010321 has 8 divisors (see below), whose sum is σ = 13224088154880. Its totient is φ = 13178573072688.
The previous prime is 13201323010303. The next prime is 13201323010333. The reversal of 13201323010321 is 12301032310231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13201323010321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13201323010292 and 13201323010301.
It is not an unprimeable number, because it can be changed into a prime (13201323010361) 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, 2063326 + ... + 5537143.
It is an arithmetic number, because the mean of its divisors is an integer number (1653011019360).
Almost surely, 213201323010321 is an apocalyptic number.
It is an amenable number.
13201323010321 is a deficient number, since it is larger than the sum of its proper divisors (22765144559).
13201323010321 is an equidigital number, since it uses as much as digits as its factorization.
13201323010321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7603463.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13201323010321 its reverse (12301032310231), we get a palindrome (25502355320552).
The spelling of 13201323010321 in words is "thirteen trillion, two hundred one billion, three hundred twenty-three million, ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •