Base | Representation |
---|---|
bin | 110000001110101000110011… |
… | …101000110010100100101111 |
3 | 1000211000201110102112211110002 |
4 | 300032220303220302210233 |
5 | 210300221111012224213 |
6 | 2031042544022134515 |
7 | 62451411046026614 |
oct | 6016506350624457 |
9 | 1024021412484402 |
10 | 212112121211183 |
11 | 61649277743656 |
12 | 1b95890028143b |
13 | 9148119781cbb |
14 | 3a543d23d450b |
15 | 197c7ca40e658 |
hex | c0ea33a3292f |
212112121211183 has 2 divisors, whose sum is σ = 212112121211184. Its totient is φ = 212112121211182.
The previous prime is 212112121211167. The next prime is 212112121211233. The reversal of 212112121211183 is 381112121211212.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 212112121211183 - 24 = 212112121211167 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212112121216183) 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, 106056060605591 + 106056060605592.
It is an arithmetic number, because the mean of its divisors is an integer number (106056060605592).
Almost surely, 2212112121211183 is an apocalyptic number.
212112121211183 is a deficient number, since it is larger than the sum of its proper divisors (1).
212112121211183 is an equidigital number, since it uses as much as digits as its factorization.
212112121211183 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 768, while the sum is 29.
Adding to 212112121211183 its sum of digits (29), we get a palindrome (212112121211212).
Adding to 212112121211183 its reverse (381112121211212), we get a palindrome (593224242422395).
The spelling of 212112121211183 in words is "two hundred twelve trillion, one hundred twelve billion, one hundred twenty-one million, two hundred eleven thousand, one hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •