Base | Representation |
---|---|
bin | 1100000001000110101101… |
… | …0101001010101010110001 |
3 | 1201210011101001121000202012 |
4 | 3000101223111022222301 |
5 | 3212440432222111304 |
6 | 44034005032132305 |
7 | 2532421301565563 |
oct | 300215325125261 |
9 | 51704331530665 |
10 | 13213120113329 |
11 | 423471a925264 |
12 | 159495b237095 |
13 | 74acb8212956 |
14 | 3397387bb333 |
15 | 17da8488716e |
hex | c046b54aab1 |
13213120113329 has 2 divisors, whose sum is σ = 13213120113330. Its totient is φ = 13213120113328.
The previous prime is 13213120113317. The next prime is 13213120113337. The reversal of 13213120113329 is 92331102131231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7957770186304 + 5255349927025 = 2820952^2 + 2292455^2 .
It is a cyclic number.
It is not a de Polignac number, because 13213120113329 - 24 = 13213120113313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13213120113295 and 13213120113304.
It is not a weakly prime, because it can be changed into another prime (13213120113379) 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, 6606560056664 + 6606560056665.
It is an arithmetic number, because the mean of its divisors is an integer number (6606560056665).
Almost surely, 213213120113329 is an apocalyptic number.
It is an amenable number.
13213120113329 is a deficient number, since it is larger than the sum of its proper divisors (1).
13213120113329 is an equidigital number, since it uses as much as digits as its factorization.
13213120113329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 32.
The spelling of 13213120113329 in words is "thirteen trillion, two hundred thirteen billion, one hundred twenty million, one hundred thirteen thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •