Base | Representation |
---|---|
bin | 1100000110010001111011… |
… | …0110100000100011101001 |
3 | 1202002122212102201101000121 |
4 | 3001210132312200203221 |
5 | 3220420030004240241 |
6 | 44142511400003241 |
7 | 2542016510436451 |
oct | 301443666404351 |
9 | 52078772641017 |
10 | 13302031321321 |
11 | 42693a5996846 |
12 | 15aa033460521 |
13 | 7564b75a98b2 |
14 | 33db70c56d61 |
15 | 18103a343ad1 |
hex | c191eda08e9 |
13302031321321 has 8 divisors (see below), whose sum is σ = 13343887972800. Its totient is φ = 13260222811440.
The previous prime is 13302031321289. The next prime is 13302031321333. The reversal of 13302031321321 is 12312313020331.
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 13302031321321 - 25 = 13302031321289 is a prime.
It is a super-3 number, since 3×133020313213213 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13302031321021) 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, 11481870 + ... + 12587191.
It is an arithmetic number, because the mean of its divisors is an integer number (1667985996600).
Almost surely, 213302031321321 is an apocalyptic number.
It is an amenable number.
13302031321321 is a deficient number, since it is larger than the sum of its proper divisors (41856651479).
13302031321321 is a wasteful number, since it uses less digits than its factorization.
13302031321321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24070799.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 13302031321321 its reverse (12312313020331), we get a palindrome (25614344341652).
The spelling of 13302031321321 in words is "thirteen trillion, three hundred two billion, thirty-one million, three hundred twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.200 sec. • engine limits •