Base | Representation |
---|---|
bin | 110000001110110011000011… |
… | …010110101001111111011011 |
3 | 1000211001202212010001121112022 |
4 | 300032303003112221333123 |
5 | 210300411123302424011 |
6 | 2031052003410005055 |
7 | 62452250500603403 |
oct | 6016630326517733 |
9 | 1024052763047468 |
10 | 212123122311131 |
11 | 61652a02562899 |
12 | 1b95aa7057678b |
13 | 91491809a31b5 |
14 | 3a54b574ad803 |
15 | 197cc211198db |
hex | c0ecc35a9fdb |
212123122311131 has 2 divisors, whose sum is σ = 212123122311132. Its totient is φ = 212123122311130.
The previous prime is 212123122311059. The next prime is 212123122311137. The reversal of 212123122311131 is 131113221321212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212123122311131 - 210 = 212123122310107 is a prime.
It is a super-2 number, since 2×2121231223111312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 212123122311131.
It is not a weakly prime, because it can be changed into another prime (212123122311137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106061561155565 + 106061561155566.
It is an arithmetic number, because the mean of its divisors is an integer number (106061561155566).
Almost surely, 2212123122311131 is an apocalyptic number.
212123122311131 is a deficient number, since it is larger than the sum of its proper divisors (1).
212123122311131 is an equidigital number, since it uses as much as digits as its factorization.
212123122311131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 864, while the sum is 26.
Adding to 212123122311131 its reverse (131113221321212), we get a palindrome (343236343632343).
The spelling of 212123122311131 in words is "two hundred twelve trillion, one hundred twenty-three billion, one hundred twenty-two million, three hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •