Base | Representation |
---|---|
bin | 1100000000111011100100… |
… | …1110011011001000101011 |
3 | 1201202212122210221012200011 |
4 | 3000032321032123020223 |
5 | 3212413322243020243 |
6 | 44032352330352351 |
7 | 2532254246215015 |
oct | 300167116331053 |
9 | 51685583835604 |
10 | 13210132001323 |
11 | 4233427144504 |
12 | 159426658b6b7 |
13 | 74a93013143a |
14 | 3395339cb1b5 |
15 | 17d95c39089d |
hex | c03b939b22b |
13210132001323 has 2 divisors, whose sum is σ = 13210132001324. Its totient is φ = 13210132001322.
The previous prime is 13210132001309. The next prime is 13210132001333. The reversal of 13210132001323 is 32310023101231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13210132001323 - 221 = 13210129904171 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13210132001294 and 13210132001303.
It is not a weakly prime, because it can be changed into another prime (13210132001333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6605066000661 + 6605066000662.
It is an arithmetic number, because the mean of its divisors is an integer number (6605066000662).
Almost surely, 213210132001323 is an apocalyptic number.
13210132001323 is a deficient number, since it is larger than the sum of its proper divisors (1).
13210132001323 is an equidigital number, since it uses as much as digits as its factorization.
13210132001323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13210132001323 its reverse (32310023101231), we get a palindrome (45520155102554).
The spelling of 13210132001323 in words is "thirteen trillion, two hundred ten billion, one hundred thirty-two million, one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •