Base | Representation |
---|---|
bin | 1100000110011010110000… |
… | …0010011000011011100101 |
3 | 1202002212222111211210102112 |
4 | 3001212230002120123211 |
5 | 3220434402401134341 |
6 | 44143542413250405 |
7 | 2542132302161201 |
oct | 301465402303345 |
9 | 52085874753375 |
10 | 13304400021221 |
11 | 426a400a70071 |
12 | 15aa594793a05 |
13 | 7567a425687a |
14 | 33dd17689b01 |
15 | 181128285aeb |
hex | c19ac0986e5 |
13304400021221 has 2 divisors, whose sum is σ = 13304400021222. Its totient is φ = 13304400021220.
The previous prime is 13304400021193. The next prime is 13304400021247. The reversal of 13304400021221 is 12212000440331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9375164248321 + 3929235772900 = 3061889^2 + 1982230^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13304400021221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13304400021421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6652200010610 + 6652200010611.
It is an arithmetic number, because the mean of its divisors is an integer number (6652200010611).
Almost surely, 213304400021221 is an apocalyptic number.
It is an amenable number.
13304400021221 is a deficient number, since it is larger than the sum of its proper divisors (1).
13304400021221 is an equidigital number, since it uses as much as digits as its factorization.
13304400021221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 13304400021221 its reverse (12212000440331), we get a palindrome (25516400461552).
The spelling of 13304400021221 in words is "thirteen trillion, three hundred four billion, four hundred million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •