Base | Representation |
---|---|
bin | 10001101000111101100… |
… | …010110101110110101011 |
3 | 11021212221020020002220112 |
4 | 101220331202311312223 |
5 | 124330103102234011 |
6 | 2324514430244535 |
7 | 153402530135201 |
oct | 21507542656653 |
9 | 4255836202815 |
10 | 1212213321131 |
11 | 4281078aa01a |
12 | 176b2795674b |
13 | 8a4079bbc47 |
14 | 429585d5071 |
15 | 217ec04758b |
hex | 11a3d8b5dab |
1212213321131 has 2 divisors, whose sum is σ = 1212213321132. Its totient is φ = 1212213321130.
The previous prime is 1212213321119. The next prime is 1212213321181. The reversal of 1212213321131 is 1311233122121.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1212213321131 is a prime.
It is a super-2 number, since 2×12122133211312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1212213321097 and 1212213321106.
It is not a weakly prime, because it can be changed into another prime (1212213321181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606106660565 + 606106660566.
It is an arithmetic number, because the mean of its divisors is an integer number (606106660566).
Almost surely, 21212213321131 is an apocalyptic number.
1212213321131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212213321131 is an equidigital number, since it uses as much as digits as its factorization.
1212213321131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 432, while the sum is 23.
Adding to 1212213321131 its reverse (1311233122121), we get a palindrome (2523446443252).
The spelling of 1212213321131 in words is "one trillion, two hundred twelve billion, two hundred thirteen million, three hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •