Base | Representation |
---|---|
bin | 1100000111010101010100… |
… | …0010000111010001010001 |
3 | 1202011101120002010201212011 |
4 | 3001311111002013101101 |
5 | 3221214101232433241 |
6 | 44155102335302521 |
7 | 2543226665414032 |
oct | 301652502072121 |
9 | 52141502121764 |
10 | 13320120202321 |
11 | 4276038665879 |
12 | 15b164137aa41 |
13 | 75810b05998a |
14 | 3409a93bca89 |
15 | 181748407281 |
hex | c1d55087451 |
13320120202321 has 2 divisors, whose sum is σ = 13320120202322. Its totient is φ = 13320120202320.
The previous prime is 13320120202289. The next prime is 13320120202327. The reversal of 13320120202321 is 12320202102331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11249557489296 + 2070562713025 = 3354036^2 + 1438945^2 .
It is a cyclic number.
It is not a de Polignac number, because 13320120202321 - 25 = 13320120202289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13320120202292 and 13320120202301.
It is not a weakly prime, because it can be changed into another prime (13320120202327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660060101160 + 6660060101161.
It is an arithmetic number, because the mean of its divisors is an integer number (6660060101161).
Almost surely, 213320120202321 is an apocalyptic number.
It is an amenable number.
13320120202321 is a deficient number, since it is larger than the sum of its proper divisors (1).
13320120202321 is an equidigital number, since it uses as much as digits as its factorization.
13320120202321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 13320120202321 its reverse (12320202102331), we get a palindrome (25640322304652).
The spelling of 13320120202321 in words is "thirteen trillion, three hundred twenty billion, one hundred twenty million, two hundred two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •