Base | Representation |
---|---|
bin | 1011001100101101100010… |
… | …0110110101111001010101 |
3 | 1121121010000212020102202212 |
4 | 2303023120212311321111 |
5 | 3103214021121044341 |
6 | 42104304023443205 |
7 | 2410404605641565 |
oct | 263133046657125 |
9 | 47533025212685 |
10 | 12313010331221 |
11 | 3a17a11372556 |
12 | 146a4162b6505 |
13 | 6b415ba99722 |
14 | 307d4a9b8da5 |
15 | 1654528c25eb |
hex | b32d89b5e55 |
12313010331221 has 2 divisors, whose sum is σ = 12313010331222. Its totient is φ = 12313010331220.
The previous prime is 12313010331197. The next prime is 12313010331269. The reversal of 12313010331221 is 12213301031321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7343503812100 + 4969506519121 = 2709890^2 + 2229239^2 .
It is a cyclic number.
It is not a de Polignac number, because 12313010331221 - 26 = 12313010331157 is a prime.
It is a super-2 number, since 2×123130103312212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12313010331421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6156505165610 + 6156505165611.
It is an arithmetic number, because the mean of its divisors is an integer number (6156505165611).
Almost surely, 212313010331221 is an apocalyptic number.
It is an amenable number.
12313010331221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12313010331221 is an equidigital number, since it uses as much as digits as its factorization.
12313010331221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 12313010331221 its reverse (12213301031321), we get a palindrome (24526311362542).
The spelling of 12313010331221 in words is "twelve trillion, three hundred thirteen billion, ten million, three hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •