Base | Representation |
---|---|
bin | 1100010110100111111… |
… | …0001100111010110111 |
3 | 202021210202122122221002 |
4 | 3011221332030322313 |
5 | 11434122203423111 |
6 | 241255301313515 |
7 | 21222201243635 |
oct | 3055176147267 |
9 | 667722578832 |
10 | 212231311031 |
11 | 82009051213 |
12 | 3516ba0589b |
13 | 1702338191c |
14 | a3b4712355 |
15 | 57c218663b |
hex | 3169f8ceb7 |
212231311031 has 2 divisors, whose sum is σ = 212231311032. Its totient is φ = 212231311030.
The previous prime is 212231311007. The next prime is 212231311063. The reversal of 212231311031 is 130113132212.
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-212231311031 is a prime.
It is a super-2 number, since 2×2122313110312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212231310994 and 212231311012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212231311231) 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, 106115655515 + 106115655516.
It is an arithmetic number, because the mean of its divisors is an integer number (106115655516).
Almost surely, 2212231311031 is an apocalyptic number.
212231311031 is a deficient number, since it is larger than the sum of its proper divisors (1).
212231311031 is an equidigital number, since it uses as much as digits as its factorization.
212231311031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 212231311031 its reverse (130113132212), we get a palindrome (342344443243).
The spelling of 212231311031 in words is "two hundred twelve billion, two hundred thirty-one million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •