Base | Representation |
---|---|
bin | 1100000111011001110100… |
… | …1101101101010011000101 |
3 | 1202011111200110211212001021 |
4 | 3001312131031231103011 |
5 | 3221224041241414341 |
6 | 44155422435231141 |
7 | 2543302001632051 |
oct | 301663515552305 |
9 | 52144613755037 |
10 | 13321331201221 |
11 | 42765aa1a420a |
12 | 15b191aa484b1 |
13 | 758271c02584 |
14 | 340a82172c61 |
15 | 1817b98b69d1 |
hex | c1d9d36d4c5 |
13321331201221 has 2 divisors, whose sum is σ = 13321331201222. Its totient is φ = 13321331201220.
The previous prime is 13321331201209. The next prime is 13321331201237. The reversal of 13321331201221 is 12210213312331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11123492336100 + 2197838865121 = 3335190^2 + 1482511^2 .
It is a cyclic number.
It is not a de Polignac number, because 13321331201221 - 217 = 13321331070149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13321331201021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660665600610 + 6660665600611.
It is an arithmetic number, because the mean of its divisors is an integer number (6660665600611).
Almost surely, 213321331201221 is an apocalyptic number.
It is an amenable number.
13321331201221 is a deficient number, since it is larger than the sum of its proper divisors (1).
13321331201221 is an equidigital number, since it uses as much as digits as its factorization.
13321331201221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 13321331201221 its reverse (12210213312331), we get a palindrome (25531544513552).
The spelling of 13321331201221 in words is "thirteen trillion, three hundred twenty-one billion, three hundred thirty-one million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •