Base | Representation |
---|---|
bin | 1011001101101101100111… |
… | …1110111101101111011101 |
3 | 1121122202102202122212011121 |
4 | 2303123121332331233131 |
5 | 3104004234101114323 |
6 | 42120231035050541 |
7 | 2411554115530213 |
oct | 263333176755735 |
9 | 47582382585147 |
10 | 12330213301213 |
11 | 3a24239a62525 |
12 | 14718175a0a51 |
13 | 6b5970b46c02 |
14 | 308add610cb3 |
15 | 165b0ccdda5d |
hex | b36d9fbdbdd |
12330213301213 has 2 divisors, whose sum is σ = 12330213301214. Its totient is φ = 12330213301212.
The previous prime is 12330213301207. The next prime is 12330213301229. The reversal of 12330213301213 is 31210331203321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12245254459684 + 84958841529 = 3499322^2 + 291477^2 .
It is a cyclic number.
It is not a de Polignac number, because 12330213301213 - 29 = 12330213300701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12330216301213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6165106650606 + 6165106650607.
It is an arithmetic number, because the mean of its divisors is an integer number (6165106650607).
Almost surely, 212330213301213 is an apocalyptic number.
It is an amenable number.
12330213301213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12330213301213 is an equidigital number, since it uses as much as digits as its factorization.
12330213301213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 12330213301213 its reverse (31210331203321), we get a palindrome (43540544504534).
The spelling of 12330213301213 in words is "twelve trillion, three hundred thirty billion, two hundred thirteen million, three hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •